Conditional negating booth multiplier

ABSTRACT

An angle rotator performs angle rotation of an input complex signal in the complex plane according to an angle θ. The angle rotator includes a coarse stage rotation and a fine stage rotation. The two specific amounts of rotation are obtained directly from the original angle, without performing iterations as are performed by known CORDIC-type methods. The coarse stage rotation is performed using truncated approximations for the cosine θ M  and the sine θ M , where θ M  is a radian angle that corresponds to a most significant word (MSW) of the input angle θ. The fine stage rotation is performed using one or more error values that compensate for approximations and quantization errors associated with the coarse stage rotation. By partitioning the rotation into coarse and fine rotation stages, a two stage structure is obtained that requires much less hardware than a single-stage rotator, without sacrificing angle precision. This can occur because the two-stage rotator stores pre-computed cosine θ M  and the sine θ M  values in a small lookup table (e.g. memory device) for fast retrieval. Furthermore, the angle rotator consolidates all operations into a small number of reduced-size multipliers, enabling the use of efficient multiplier implementations, such as Booth encoding, thereby yielding a smaller and faster overall circuit. When higher precision is desired, more accurate results can be attained simply by increasing the wordlength and the multiplier size, without significantly increasing overall circuit latency.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. Non-Provisional application Ser. No. 09/698,246, filed Oct. 30, 2000, which claims the benefit of U.S. Provisional Application No. 60/162,391, filed on Oct. 29, 1999, all of which are incorporated herein by reference.

U.S. Non-Provisional application Ser. No. 09/698,249, filed Oct. 30, 2000, entitled, “Apparatus and Method for Rectangular-to-Polar Conversion” of common assignee is related to the parent application and is herein incorporated by reference in its entirety.

STATEMENT REGARDING FEDERALLY-SPONSORED RESEARCH AND DEVELOPMENT

This invention was made with Government support under grant no. MIP 9632698 awarded by the National Science Foundation. The U.S. Government has certain rights in this invention.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention is related to digital signal processing and digital communications. More specifically the present invention is related to interpolation, angle rotation, rectangular-to-polar conversion, and carrier and symbol timing recovery for digital processing and digital communications applications.

2. Related Art

Advances in technology have enabled high-quality, low-cost communications with global coverage, and provide the possibility for fast Internet access and multimedia to be added to existing services. Exemplary emerging technologies include cellular mobile radio and digital video broadcasting, both of which are described briefly as follows.

In recent years, cellular mobile radio has experienced rapid growth due to the desire for mobility while enjoying the two-way voice services it provides. GSM, IS-136 and personal digital cellular (PDC) are among the most successful second-generation personal communications (PCS) technologies in the world today, and are responsible for providing cellular and PCS services globally. As the technology advances, customers will certainly demand more from their wireless services. For example, with the explosive growth of the world wide web over the wired networks, it is desirable to provide Internet services over mobile radio networks. One effort to specify the future global wireless access system is known as IMT-2000 (Buchanan, K., et al., IEEE Pers. Comm. 4:8-13 (1997)). The goal of IMT-2000 is to provide not only traditional mobile voice communications, but also a variety of voice and data services with a wide range of applications such as multimedia capabilities, Internet access, imaging and video conferencing. It is also an aim to unify many existing diverse systems (paging, cordless, cellular, mobile satellite, etc.) into a seamless radio structure offering a wide range of services. Another principle is to integrate mobile and fixed networks in order to provide fixed network services over the wireless infrastructure. Such systems might well utilize broadband transport technologies such as asynchronous transfer mode (ATM).

For the applications of IMT-2000, a high-bit-rate service is needed. Moreover, for multimedia applications, the system should provide a multitude of services each requiring 1) a different rate, and 2) a different quality-of-service parameter. Thus, a flexible, variable-rate access with data rates approaching 2 Mb/s is proposed for IMT-2000.

The advent of digital television systems has transformed the classical TV channel into a fast and reliable data transmission medium. According to the specifications of the DVB project (Reimers, U., IEEE Comm. Magazine 36:104-110 (1998)), digital TV is no longer restricted to transmitting sound and images but instead has become a data broadcasting mechanism which is fully transparent to all contents. Digital TV broadcasting by satellite, cable and terrestrial networks is currently under intensive development. A typical system looks like this: a DVB signal is received from a satellite dish, from cable, or from an antenna (terrestrial reception). A modem built into an integrated receiver/decoder (IRD) will demodulate and decode the signal. The information received will be displayed on a digital TV or a multimedia PC. In addition to being used as a digital TV, DVB can receive data streams from companies who wish to transmit large amounts of data to many reception sites. These organizations may be banks, chains of retail stores, or information brokers who wish to offer access to selected Internet sites at high data rates. One such system is MultiMedia Mobile (M³), which has a data rate of 16 Mb/s.

For proper operation, these third generation systems require proper synchronization between the transmitter and the receiver. More specifically, the frequency and phase of the receiver local oscillator should substantially match that of the transmitter local oscillator. When there is a mismatch, then an undesirable rotation of the symbol constellation will occur at the receiver, which will seriously degrade system performance. When the carrier frequency offset is much smaller than the symbol rate, the phase and frequency mismatches can be corrected at baseband by using a phase rotator. It is also necessary to synchronize the sampling clock such that it extracts symbols at the correct times. This can be achieved digitally by performing appropriate digital resampling.

The digital resampler and the direct digital frequency synthesizer (DDS) used by the phase rotator are among the most complex components in a receiver (Cho, K., “A frequency-agile single-chip QAM modulator with beamforming diversity,” Ph.D. dissertation, University of California, Los Angeles (1999)). Their performance is significant in the overall design of a communications modem. For multimedia communications, the high-data-rate requirement would impose a demand for high computational power. However, for mobile personal communication systems, low cost, small size and long battery life are desirable. Therefore, it would be desirable to have an efficient implementation of the phase rotator, re-sampler, and DDS in order to perform fast signal processing that operates within the available resources. Furthermore, it would be desirable to have an efficient synchronization mechanism that uses a unified approach to timing and carrier phase corrections.

For Internet services it is important to provide instantaneous throughput intermittently. Packet data systems allow the multiplexing of a number of users on a single channel, providing access to users only when they need it. This way the service can be made more cost-effective. However, the user data content of such a transmission is usually very short. Therefore, it is essential to acquire the synchronization parameters rapidly from the observation of a short signal-segment.

For applications where low power and low complexity are the major requirements, such as in personal communications, it is desirable to sample the signal at the lowest possible rate, and to have a synchronizer that is as simple as possible. Therefore, it is also desirable to have an efficient synchronizer architecture that achieves these goals.

For applications utilizing Orthogonal Frequency Division Multiplexing (OFDM), sampling phase shift error produces a rotation of the Fast Fourier Transform (FFT) outputs (Pollet T., and Peters, M., IEEE Comm. Magazine 37:80-86 (1999)). A phase correction can be achieved at the receiver by rotating the FFT outputs. Therefore, it is also desirable to have an efficient implementation structure to perform rotations of complex numbers.

SUMMARY OF THE INVENTION

The present invention is directed at an apparatus and method for performing angle rotation. More specifically, the angle rotator rotates an input complex signal in the complex plane according to the angle θ, to produce a rotated output signal. In doing so, the angle rotator performs a two stage rotation that includes a coarse stage rotation and a fine stage rotation. The two specific amounts of rotation are obtained directly from the original angle, without performing iterations as performed by known CORDIC-type methods. Therefore, the critical path of the present invention is significantly shorter than that of the CORDIC-type methods.

The coarse stage rotation is performed using truncated approximations for the cosine θ_(M) and the sine θ_(M), where θ_(M) is a radian angle that corresponds to a most significant word (MSW) of the input angle θ. The resulting intermediate complex signal is rotated by a second amount during the fine stage rotation. The fine stage rotation is performed using one or more error values that compensate for approximations and quantization errors associated with the coarse stage rotation.

By partitioning the rotation into coarse and fine rotation stages, a two stage structure is obtained that requires much less hardware than a single stage rotator, without sacrificing angle precision. This can occur because the two stage rotator stores pre-computed cosine θ_(M) and the sine θ_(M) values in a small lookup table (e.g. memory device) for fast retrieval. This same lookup table can be reused by a phase rotator for carrier recovery, in systems wherein both subsystems are present. Furthermore, the angle rotator consolidates all operations into a small number of reduced-size multipliers, enabling the use of efficient multiplier implementations, such as Booth encoding, thereby yielding a smaller and faster overall circuit. When higher precision is desired, more accurate results can be attained simply by increasing the wordlength and the multiplier size, without increasing overall circuit latency. Further efficiency in implementation can be achieved by exploiting certain opportunities presented by Booth encoding methods in relation to the angle rotator's special “two-butterfly” structure.

Although the angle-rotation processor is initially intended for the trigonometric-based resampler and the phase rotator for carrier recovery, its application well exceeds that of synchronization. It can be applied to efficiently implement many communication functions and non-communications functions, wherever the operations can be characterized as multiplying complex numbers by a complex exponential. Such applications include but are not limited to Quadrature Direct Digital Frequency Synthesizer/Mixer (QDDFSM) applications, Direct Digital Frequency Synthesizer (DDFS) applications, Fast Fourier Transform (FFT) and Inverse FFT applications, and, more generally, Discrete Fourier Transform applications.

Further features and advantages of the invention, as well as the structure and operation of various embodiments of the invention, are described in detail below with reference to the accompanying drawings. The drawing in which an element first appears is typically indicated by the leftmost character(s) and/or digit(s) in the corresponding reference number.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1A illustrates a PSK transmitter.

FIG. 1B illustrates a PSK receiver.

FIG. 1C illustrates a block diagram of an OFDM system.

FIG. 1D illustrates a PSK receiver with carrier and timing recovery.

FIG. 2 illustrates an Interpolation environment.

FIG. 3 illustrates Lagrange basis polynomials.

FIG. 4 illustrates a Farrow structure that implements (2.5) and (2.6).

FIG. 5 illustrates a flowchart 500 representing trigonometric interpolation according to embodiments of the present invention.

FIG. 6A. illustrates an impulse response of a Lagrange interpolator.

FIG. 6B illustrates an impulse response of a Trigonometric interpolator according to embodiments of the present invention.

FIG. 7A illustrates a frequency response for N=4 according to embodiments of the present invention.

FIG. 7B illustrates a frequency response for N=32 according to embodiments of the present invention.

FIG. 8A illustrates a signal with two samples/symbol and 100% excess BW according to embodiments of the present invention.

FIG. 8B illustrates an NMSE of the interpolated signal according to embodiments of the present invention.

FIG. 9 illustrates the critical path of the Lagrange cubic interpolator.

FIG. 10 illustrates a trigonometric interpolator with N=4 according to embodiments of the present invention.

FIG. 11 illustrates a trigonometric interpolator with N=8 according to embodiments of the present invention.

FIG. 12 illustrates a conceptual modification of input samples according to embodiments of the present invention.

FIG. 13 illustrates correcting the offset due to modification of original samples according to embodiments of the present invention.

FIG. 14 illustrates the modified trigonometric interpolator for N=4 according to embodiments of the present invention.

FIG. 15 illustrates the modified trigonometric interpolator for N=8 according to embodiments of the present invention.

FIG. 16A-D illustrates a comparison of the amount of interpolation error using (A) Lagrange cubic, (B) the trigonometric interpolator 1000, (C) the trigonometric interpolator 1400, (D) the optimal structure (to be discussed in Section 4).

FIG. 17 illustrates a flowchart 1700 representing trigonometric interpolation according to embodiments of the present invention.

FIG. 18 illustrates trigonometric interpolation using a table lookup for angle rotation according to embodiments of the present invention.

FIG. 19 illustrates trigonometric interpolation using modified samples according to embodiments of the present invention.

FIG. 20 illustrates normalized impulse responses f of the interpolation filters according to embodiments of the present invention.

FIG. 21 illustrates normalized frequency responses F of the interpolation filters according to embodiments of the present invention.

FIG. 22 illustrates analysis of the frequency responses according to embodiments of the present invention.

FIG. 23 illustrates the effect of a more gradual transition at the band edge according to embodiments of the present invention.

FIG. 24 illustrates reducing the transition bandwidth by increasing N according to embodiments of the present invention.

FIGS. 25A-B illustrate (A) impulse response of the original filter and the modified filter; (B) The equivalent window, according to embodiments of the present invention.

FIG. 26 illustrates forming the frequency response of the discrete-time fractional-delay filter according to embodiments of the present invention.

FIGS. 27A-B illustrate a fractional-delay filter with (A) μ=0.12 and (B) μ=0.5, using the preliminary N=8 interpolator according to embodiments of the present invention.

FIGS. 28A-D illustrate modification to F(Ω), and the corresponding F_(μ)(ω) according to embodiments of the present invention.

FIGS. 29A-B illustrate F_(μ)(ω), with μ=0.5, N=8, (A) before and (B) after optimization according to embodiments of the present invention.

FIGS. 30A-30B illustrate F_(μ)(ω) for μ=0.5, N=4, (A) before and (B) after modification according to embodiments of the present invention.

FIGS. 31A-31B illustrate F_(μ)(ω), μ=0.5, simplified N=4 structure, (A) before and (B) after modification according to embodiments of the present invention.

FIG. 32 illustrates real and imaginary components of the ${{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}$ value according to embodiments of the present invention.

FIG. 33 illustrates signal with two samples/symbol and 40% excess bandwidth according to embodiments of the present invention.

FIG. 34 illustrates a flowchart 3400 for optimizing trigonometric interpolation according to embodiments of the present invention.

FIG. 35 illustrates a flowchart 3500 for optimizing trigonometric interpolation according to embodiments of the present invention.

FIG. 36 illustrates an optimized interpolator 3600 according to embodiments of the present invention.

FIG. 37 illustrates an optimized interpolator 3700 according to embodiments of the present invention.

FIG. 38 illustrates an angle rotator 3800 according to embodiments of the present invention.

FIG. 39 illustrates an angle rotator 3900 according to embodiments of the present invention.

FIG. 40 illustrates an angle rotator 3900 and example multiplier sizes according to embodiments of the present invention.

FIG. 41 illustrates a flowchart 4100 for angle rotation according to embodiments of the present invention.

FIG. 42 illustrates an angle rotator 3900 and multiplier sizes to achieve 90.36 dB SFDR according to embodiments of the present invention.

FIG. 43 illustrates an output spectrum showing 90.36 dB SFDR according to embodiments of the present invention.

FIG. 44 illustrates a modified angle rotator 4400 when only one output is needed according to embodiments of the present invention.

FIG. 45 illustrates a flowchart 4500 for angle rotation when only one output is needed according to embodiments of the present invention.

FIG. 46 illustrates a phase accumulator 4600.

FIG. 47 illustrates a Quadrature Direct Digital Frequency Synthesizer/Mixer (QDDFSM) 4700 according to embodiments of the present invention.

FIG. 48 illustrates an angle rotator 4800 according to embodiments of the present invention.

FIG. 49 illustrates a Booth multiplier.

FIG. 50 illustrates an original Booth table 5000.

FIG. 51 illustrates a negating Booth table 5100 according to embodiments of the present invention.

FIG. 52 illustrates a negating Booth multiplier 5200.

FIG. 53 illustrates a conditionally negating Booth decoder 5300 according to embodiments of the present invention.

FIG. 54 illustrates a conditionally negating multiplier 5400 according to embodiments of the present invention.

FIG. 55 illustrates as an angle rotator configured as quadrature direct digital synthesizer (QDDS) 5500 according to embodiments of the present invention.

FIG. 56 illustrates an angle rotator as a cosine only direct digital synthesizer based on angle rotator 3900 according to embodiments of the present invention.

FIG. 57 illustrates an angle rotator as a cosine only direct digital synthesizer based on angle rotator 4400 according to embodiments of the present invention.

FIG. 58 illustrates a common packet format for packet based communications.

FIG. 59 illustrates a system model for packet based communications.

FIG. 60 illustrates mean values of a preamble correlator output, for θ=0, according to embodiments of the present invention.

FIG. 61 illustrates a synchronizer 6100 according to embodiments of the present invention.

FIG. 62 illustrates a flowchart 6200 associated with the synchronizer 6100 according to embodiments of the present invention.

FIG. 63 illustrates bias due to truncation.

FIG. 64 illustrates simultaneous operation of a symbol-timing synchronizer and a carrier phase recovery system 6400 according to embodiments of the present invention.

FIG. 65A-65B illustrate a flowchart 6500 associated with the synchronizer 6400 according to embodiments of the present invention.

FIG. 66 illustrates timing variance, α=0.4.

FIG. 67 illustrates timing jitter variance, α=0.1.

FIG. 68 illustrates phase jitter variance, α=0.1.

FIG. 69 illustrates Cartesian-to-polar conversion.

FIGS. 70A-70B illustrate using Newton-Raphson iteration to find 1/X₁.

FIG. 71 illustrates a rectangular-to-polar converter 7100 according to embodiments of the present invention.

FIG. 72 illustrates angle rotation associated with the rectangular-to-polar converter 7100 according to embodiments of the present invention.

FIG. 73 illustrates a flowchart 7300 associated with the synchronizer 7100 according to embodiments of the present invention.

FIG. 74 illustrates Interpolation in a non-center interval according to embodiments of the present invention.

FIGS. 75A-B illustrate impulse responses of the non-center-interval interpolation filter (A) before and (B) after optimization, according to embodiments of the present invention.

FIGS. 76A-B illustrate frequency responses of the non-center-interval interpolator (A) before optimization and (B) after optimization, according to embodiments of the present invention.

FIG. 77 illustrates an exemplary computer system 7702, according to embodiments of the present invention.

FIG. 78 illustrates a data rate expansion circuit 7800 according to embodiments of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Table of Contents

-   1. Introduction -   1.1 Exemplary Modulation Schemes and Synchronization Issues -   1.2 Overview -   2. Interpolation Using a Trigonometric Polynomial -   2.1 Interpolation Using an Algebraic Polynomial -   2.2 The Trigonometric Polynomial Method -   2.3 Performance Comparisons -   2.4 Efficient Implementation Structures -   2.4.1 Using a Lookup Table -   2.4.2 Using an Angle Rotation Processor -   2.5 Delays in the Computation -   2.6 Simplifications of the Preliminary Structures -   2.6.1 The Simplified Structure for N=4 -   2.6.2 The Simplified Structure for N=8 -   2.6.3 Performance Comparisons with Other Structures -   2.7 Trigonometric Interpolator Application -   2.8 Trigonometric Interpolator Summary -   3. Interpolation Filters with Arbitrary Frequency Response -   3.1 Formulating the Trigonometric Interpolator as an Interpolation     Filter -   3.2 Analysis of the Frequency Response -   3.3 Implementing the Modified Algorithm -   3.4 Conditions for Zero ISI -   3.5 Optimization Algorithm -   3.6 Conclusion -   4. Design of Optimal Resamplers -   4.1 Motivation -   4.2 Resampler Optimizations -   4.3 Implementations -   4.4 Simulation Results -   4.5 Conclusion -   5. A High-Speed Angle Rotation Processor -   5.1 The angle rotation problem -   5.1.1 Single-Stage Angle Rotation -   5.1.2 Rotation by a Small Angle -   5.1.3 Partitioning into Coarse and Fine Rotations -   5.2 Simplification of the Coarse Stage -   5.3 Reduction of Multiplier Size in the Fine Stage -   5.4 Scaling Multiplier Simplification -   5.5 Computational Accuracy and Wordlength -   5.6 Comparison with the Single-Stage Mixer -   5.7 A Modified Structure When Only One Output is Needed 5.7.1     Modifications to the Coarse Stage -   5.7.2 Scaling Multiplier Simplification -   5.8 Application of Angle Rotation Processors -   5.8.1 Using the Angle Rotation Processor in a Quadrature Direct     Digital Frequency Synthesizer/Mixer -   5.8.1.1 A General Angle Rotator for Arbitrary Input Angles -   5.8.1.2 Adapting the General Angle Rotator to Make a QDDFSM 5.8.2     How to Use the Conditionally Negating Multipliers in the General     Angle Rotator -   5.8.2.1 Booth Multiplier -   5.8.2.2 How to Make a Negating Booth Multiplier -   5.8.2.3 How to Make a Conditionally Negative Booth Multiplier -   5.8.3 Using the Angle Rotation Processor in a Quadrature Direct     Digital Frequency Synthesizer -   5.9 Conclusion -   6. Symbol Synchronization for Bursty Transmissions -   6.1 Initial Parameter Estimations for Burst Modems -   6.2 Background Information -   6.3 Symbol Timing Estimation Assuming 0=0 -   6.4 Bias in Symbol Timing Estimation due to Truncating the Sequence -   6.5 Carrier-Independent Symbol Timing Recovery -   6.6 Carrier Phase Computation -   6.7 Simulation Result -   6.8 Conclusion -   7. A High-Speed Processor for Rectangular-to-Polar Conversion -   7.1 Partitioning the Angle -   7.2 The Two-Stage Algorithm -   7.2.1 Simplification in the Coarse Computation Stage -   7.2.1.1 The Reciprocal Table 7106 -   7.2.1.2 The Arctangent Table 7110 -   7.2.2 Hardware Reduction in the Fine Computation Stage 7124 -   7.3 Magnitude Calculation -   7.4 Converting Arbitrary Inputs -   7.5 Test Result -   7.6 Conclusion -   8. Exemplary Computer System -   9. Appendices -   9.1 Appendix A: Proof of the Zero ISI Condition. -   9.2 Appendix B: Impulse Response of the Simplified Interpolators -   9.3 Appendix C: Fourier Transform of g(nTs μ) -   9.4 Appendix D: Interpolation on Non-Center Intervals -   9.5 Appendix E -   10. Conclusion

1. INTRODUCTION

As discussed herein, third generation and other cutting edge communications systems require proper synchronization between the transmitter and the receiver. More specifically, the frequency and phase of the receiver local oscillator should substantially match that of the transmitter local oscillator and accurate symbol timing must be achieved. The following section discuss some exemplary modulation schemes and configurations, and their related synchronization issues. These example configurations are not meant to be limiting, and are provided for example purposes only. After which, an overview of the present invention is provided.

1.1 Exemplary Modulation Schemes and Synchronization Issues

A key to the evolution of third-generation PCS is the ability to provide higher data rates via increased spectral efficiency of the access scheme. The IS-136 community intends to add a 200-KHz carrier bandwidth and adopt 8PSK modulation. This allows for data rates up to 384 Kb/s.

A simplified 8PSK transmitter 102 and receiver 104 are shown in FIG. 1A and FIG. 1B, respectively. The receiver 104, as shown, performs baseband sampling. Alternatively, the received signal could be sampled at an IF frequency, where the down-conversion to baseband is performed digitally. However, since it does not alter the main subject in the present invention, the baseband-sampled system is used as an example.

Referring to FIG. 1B, PSK receiver 104 down-converts an IF input signal 106 to baseband by multiplication with a local oscillator signal 108 using mixers 110. After filtering 111, A/D converters 112 sample the down-converted signal according to a sampling clock 114 in preparation for logic examination. After further filtering 116 and equalization 118, the logic decision devices 120 examine the sampled signal to determine a logic output for the two channels.

During down-conversion, an undesirable rotation of the symbol constellation will occur if the frequency and phase of the oscillator signal 108 does not match the oscillator signal of the transmitter 102. This symbol rotation can seriously degrade system performance. When the carrier frequency offset is much smaller than the symbol rate, the phase and frequency mismatches can be corrected at baseband, using a phase rotator 124, as shown in FIG. 1D.

The sampling clock 114 is generated locally in the receiver 104. The logic decision devices 120 make more accurate decisions when the sampling instant is optimal, i.e., synchronous to the incoming symbols.

If the timing information can be extracted from the signal 106, it can be used to adjust the phase of the sampling clock 114. This adjustment would require a voltage controlled oscillator (VCO) to drive the A/D converters 112. In this scenario, the digital portion of the circuit 104 needs to keep in synchronization with the A/D converters 112, which places strict requirements on the VCO. Moreover, changing the phase of the sampling clock 114 would cause jitter. High data-rate receivers are more sensitive to such jitter when used in multimedia communications.

Another solution to timing errors is to correct them entirely in the digital domain, with the equivalent of A/D sampling adjustment performed by a digital resampler 122, as shown in FIG. 1D. This resampler 122 is controlled by a timing recovery circuit (not shown) and it attempts to supply the optimal samples (i.e. synchronous) to the decision circuits 120. Using the digital resampler 122, the timing recovery loop is closed entirely in the digital domain. This allows the complete separation of digital components from analog components.

The digital resampler 122 and a direct digital frequency synthesizer (not shown) used by the phase rotator 124 are among the most complex components in a receiver (Cho, K., “A frequency-agile single-chip QAM modulator with beamforming diversity,” Ph.D. dissertation, University of California, Los Angeles (1999)). Their performance is significant in the overall design of the modem. For multimedia communications, the high-data-rate requirement imposes a demand for high computational power. However, for mobile personal communication systems, low cost, small size, and long battery life are desirable. Therefore, efficient implementation is the key to implementing fast signal processing within the available resources. It is also desirable to provide an efficient synchronization mechanism by using a unified approach to timing and carrier phase corrections. This can be accomplished by sharing resources between the resampler 122 and the phase rotator 124.

As for the digital video broadcasting system (DVB) systems, the most challenging of all DVB transmissions is the one used in terrestrial channels (DVB-T) due to the presence of strong echoes which characterize the propagation medium. A common approach for DVB-T is based on Coded-OFDM (orthogonal frequency division multiplexing). The major benefit of OFDM is that the serial baseband bitstream which needs to be transmitted is distributed over many individual subcarriers. Such spreading makes the signal robust against the effects of multipath and narrowband interference. The simplified block diagram of an OFDM modem 108 is shown in FIG. 1C.

FIG. 1C illustrates an orthogonal frequency division multiplexing system (OFDM) 126 having an OFDM transmitter 128 and an OFDM receiver 130. For the OFDM system 126, synchronization errors produce a rotation of the fast Fourier Transform (FFT) outputs of the OFDM receiver 130. (Pollet T., and Peeters, M., IEEE Comm. Magazine 37:80-86 (1999)). A sampling phase correction for the received signals can be achieved by rotating the FFT outputs at the receiver. For FFT rotation, it is desirable to have an efficient implementation structure to perform rotations of complex numbers.

The example applications and modulation schemes described above in this section were provided for illustrative purposes only, and are not meant to be limiting. Other applications and combinations of such applications will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein. These other applications are within the scope and spirit of the present invention.

1.2 Overview

The following is an overview of the sections that follow.

Sections 2, 3 and 4, discussed herein, present a novel interpolation method for digital resampling using a trigonometric polynomial. In Section 2, after a brief review of interpolation methods, particularly those using a conventional polynomial, the trigonometric interpolation method is introduced. Efficient implementation structures for trigometric interpolation are given. The performance, hardware complexity and computational delay are compared with conventional polynomial interpolators. The trigonometric-polynomial based resampler can use the same hardware as is employed in the phase rotator for carrier synchronization, thus further reducing the total complexity in the synchronization circuitry.

In Section 3, a signal processing approach is used to analyze the interpolation method devised in Section 2. It shows how an arbitrary frequency response is achieved by applying a simple modification to the original interpolation algorithm. This enables the interpolator to also perform matched filtering of the received signal.

The approaches in Section 3 can be employed to improve the interpolator performance by optimizing the frequency response of the continuous-time interpolation filter. This method is based on optimizing the performance by conceptually reconstructing the continuous-time signal from existing samples. From the point of view of designing digital resamplers, however, what we are actually interested in are new samples corresponding to the new sampling instants. In Section 4, we optimize the interpolation filter such that the error in producing a new sample corresponding to every resampling instant is minimized, hence further improving the overall interpolation accuracy.

Section 5 presents an angle rotation processor that can be used to efficiently implement the trigonometric resampler and the carrier phase rotator. This structure can also implement the resampler for an OFDM receiver, which rotates the FFT outputs. It has many other practical applications.

The discussions in the previous Sections have assumed that the sampling mismatch that is supplied to the resampler is known. The problem of obtaining the synchronization parameters is studied in Section 6. For burst mode transmissions in packet data systems, we present an efficient architecture for feedforward symbol-timing and carrier-phase estimation.

Section 7 presents an efficient implementation of a key component in the feedforward synchronizer of Section 6, as well as in many other such synchronizers. This involves computing the angle from the real and imaginary components of a complex number. The discussion, however, extends to a general problem of Cartesian-to-polar conversion, which is encountered in many communication applications. An architecture that efficiently accomplishes this conversion is presented.

Section 8 presents an exemplary computer system in which the invention can be operated.

Section 9 includes various appendices.

Further discussions related to materials in Sections 2-7 are included in Dengwei Fu, “Efficient Synchronization for Multimedia Communications,” Ph.D dissertation, University of California, Los Angeles, 2000, which is incorporated-by-reference, in its entirety.

Additionally, the following articles are herein incorporated by reference:

D. Fu and A. N. Willson, Jr., “A high-speed processor for digital sine/cosine generation and angle rotation,” in Conf. Record 32nd Annual Asilomar Conference on Signals, Systems and Computers, vol. 1, pp. 177-181, November 1998;

D. Fu and A. N. Willson, Jr., “Interpolation in timing recovery using a trigonometric polynomial and its implementation,” in Proc. GLOBECOM 1998, Comm. Theory Mini-Conference Record, pp. 173-178, November 1998;

D. Fu and A. N. Willson, Jr., “Design of an improved interpolation filter using a trigonometric polynomial,” in Proc. Int. Symp. Circuits & Systems, vol. 4, pp. 363-366, May 30-Jun. 3, 1999;

D. Fu and A. N. Willson, Jr., “A high-speed processor for rectangular-to-polar conversion with applications in digital communications,” in Proc. GLOBECOM 1999, vol. 4, pp. 2172-2176, December 1999;

D. Fu and A. N. Willson, Jr., “A fast synchronizer for burst modems with simultaneous symbol timing and carrier phase estimations,” in Proc. Int. Symp. Circuits & Systems, vol. 3, pp. 379-382, May 28-31, 2000; and

D. Fu and A. N. Willson, Jr., “Optimal interpolator using a trigonometric polynomial,” in Proc. 43rd Midwest Symp. Circuits & Systems, 4 pages, Aug. 8-11, 2000.

2. INTERPOLATION USING A TRIGONOMETRIC POLYNOMIAL

As discussed in Section 1, when an analog-to-digital converter (ADC) is clocked at a fixed rate, the resampler must provide the receiver with correct samples, as if the sampling is synchronized to the incoming symbols. How can the resampler recover the synchronized samples by digital means without altering the sampling clock? Since the input analog signal to the ADC is bandlimited, as long as the sampling rate is at least twice the signal bandwidth, according to the sampling theorem, the sampled signal carries as much information as the continuous-time signal. Therefore, the value of the original continuous-time signal at an arbitrary point can be evaluated by applying an interpolation filter (e.g., sinc interpolation) to the samples. Hence, the design of the resampler has been transformed to the design of effective interpolation filters or, in other words, fractional-delay filters with variable delay.

There are numerous methods for designing fractional-delay filters. These filters have different coefficients for different delays. Thus, to implement variable-delay interpolation filters, one could compute one set of coefficients for each quantized delay value and store them in a memory. Then, in real-time, depending on the fractional delay extracted from the incoming signal, the corresponding coefficients could be loaded. However, this method is likely to result in a large coefficient memory.

To design low-cost modems, a large coefficient memory is undesirable. Gardner, et al., have shown that polynomials can be incorporated to compute the desired samples that are synchronous with the transmitted samples (Gardner, F. M., IEEE Trans. Comm. 41:502-508 (1993); Erup, L., et al., IEEE Trans. Comm. 41:998-1008 (1993)). In this case, an extensive coefficient memory is not needed. Moreover, the polynomial-based structure can be implemented efficiently with a so-called Farrow structure (Farrow, C., “A continuously variable digital delay element,” in Proc. IEEE Int. Symp. Circuits Syst. (June 1988), pp. 2641-2645). This method is reviewed in Section 2.1. Although this approach achieves reasonable performance, the hardware complexity grows rapidly as the number of samples used to calculate each new sample is increased for better accuracy. In addition, given a fractional delay μ, to produce a new sample using a degree N−1 polynomial, there will be N−1 sequential multiplications that involve μ since we must compute R raised to the (N−1)-th power times a data value. Thus, the critical data path gets longer as N increases, thereby creating a limitation on the achievable data rate.

Starting in Section 2.2, a new approach to interpolation is introduced. Instead of approximating the continuous-time signal with a conventional (i.e., algebraic) polynomial, a trigonometric polynomial is used according to the present invention. First, some background information is given. Next, the detailed implementation is discussed. We then evaluate and compare the performance and computational complexity of the algebraic polynomial interpolation to that of our method, giving numerical results.

2.1 Interpolation Using an Algebraic Polynomial

To interpolate using function values y(n) at N equally-spaced sample points, also referred to as a “base point set,” we can fit an algebraic polynomial of degree N−1 to the data, as in FIG. 2. As explained in (Gardner, F. M., IEEE Trans. Comm. 41:502-508 (1993)), there should be an even number of samples in the base point set, and the interpolation should be performed only in the center interval of the base point set. That is, N is restricted to be even. In other words, given 4 samples points in FIG. 2 including y(−1), y(0), y(1), and y(2), the interpolation is performed at offset t between the points y(0) and y(1) to determine the point 202 on the curve p(t).

It seems that one would have to solve for the coefficients of the (N−1)-th degree polynomial from these available samples before the synchronized (i.e., interpolated) samples can be computed. However, a method devised by Farrow (Farrow, C., “A continuously variable digital delay element,” in Proc. IEEE Int. Symp. Circuits Syst. (June 1988), pp. 2641-2645) can compute the synchronized sample from the available samples efficiently with use of an algorithm that is well suited for VLSI implementation. To illustrate, we consider the following example of interpolation using a cubic Lagrange polynomial. Without loss of generality, let us assume the sampling interval is T_(S)=1. Using the Lagrange formula for N=4, the synchronized samples can be computed as y(μ)=y(−1)C ⁻¹(μ)+y(0)C ₀(μ)+y(1)C ₁(μ)+y(2)C ₂(μ)  (2.1) where C_(n)(μ), n=−1, 0, 1, 2, are the third degree polynomials that are shown in FIG. 3. Obviously, $\begin{matrix} {{C_{n}(\mu)} = \left\{ \begin{matrix} {{{1\quad\mu} = {nT}_{s}},{n\quad{an}\quad{integer}}} \\ {0\quad{all}\quad{other}\quad{{integers}.}} \end{matrix} \right.} & (2.2) \end{matrix}$ Thus, y(μ) in (2.1), the sum of polynomials C_(n)(μ) weighted by the y(n) values, must be a third degree polynomial and must go through the samples y(−1), y(0), y(1) and y(2). Writing C_(n)(μ) as $\begin{matrix} {{C_{n}(\mu)} = {\sum\limits_{k = 0}^{3}{c_{nk}\mu^{k}}}} & (2.3) \end{matrix}$ the coefficients C_(nk) of C_(n)(μ) are fixed numbers. They are independent of μ. We can re-write (2.1) as $\begin{matrix} \begin{matrix} {{y(\mu)} = {\sum\limits_{n = {- 1}}^{2}{{y(n)}{\sum\limits_{k = 0}^{3}{c_{nk}\mu^{k}}}}}} \\ {= {\sum\limits_{k = 0}^{3}{\left( {\sum\limits_{n = {- 1}}^{2}{{y(n)}c_{nk}}} \right)\mu^{k}}}} \\ {= {\sum\limits_{k = 0}^{3}{{v(k)}\mu^{k}}}} \end{matrix} & (2.4) \end{matrix}$ where $\begin{matrix} {{v(k)} = {\sum\limits_{n = {- 1}}^{2}{{y(n)}{c_{nk}.}}}} & (2.5) \end{matrix}$

To minimize the number of multipliers, we can use a nested evaluation of (2.4), as y(μ)=((v(3)μ+v(2))μ+v(1))μ+v(0).  (2.6)

A Farrow structure 400 (for N=4) that implements equations (2.5) and (2.6) is shown in FIG. 4. It consists of multiplications of data by fixed coefficients, and data multipliers, as well as addition operations.

2.2 The Trigonometric Polynomial Method

To solve the problems discussed in the section 2.1, the present invention utilizes a trigonometric polynomial to fit the asynchronous samples in FIG. 2. Using W_(N)=e^(−j2π/N) notation, for tε[−N/2+1, N/2], the polynomial may be written as: $\begin{matrix} {{y(t)} = {\frac{1}{N}{\left( {{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{c_{k}W_{N}^{- {kt}}}} + {\frac{1}{2}c_{N/2}W_{N}^{{- {({N/2})}}t}} + {\frac{1}{2}c_{{- N}/2}W_{N}^{{({N/2})}t}}} \right).}}} & (2.7) \end{matrix}$

The polynomial must cross the N samples. Thus, the coefficients c_(k) can be determined by solving the N linear equations in N unknowns: $\begin{matrix} {{{y(n)} = {\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{N/2}{c_{k}W_{N}^{- {kn}}}}}},{n = {{- \frac{N}{2}} + 1}},\ldots\quad,\frac{N}{2}} & (2.8) \end{matrix}$ whose solution is $\begin{matrix} {{c_{k} = {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{{y(n)}W_{N}^{kn}}}},{k = {{- \frac{N}{2}} + 1}},\ldots\quad,{\frac{N}{2}.}} & (2.9) \end{matrix}$

The expression in (2.9) is simply the N-point discrete Fourier transform (DFT). This suggests that, given N equally-spaced samples, we can compute the DFT of these samples as in (2.9) to obtain the coefficients of the interpolating trigonometric polynomial in (2.7). Then, for a given offset μ, the synchronized sample y(μ) can be computed using that polynomial as: $\begin{matrix} {{y(\mu)} = {\frac{1}{N}{\left( {{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{c_{k}W_{N}^{{- k}\quad\mu}}} + {c_{N/2}\cos\quad\pi\quad\mu}} \right).}}} & (2.10) \end{matrix}$ Since c_(k) and c_(−k) are conjugates, this equation can be simplified as $\begin{matrix} {{y(\mu)} = {\frac{1}{N}{{{Re}\left( {c_{0} + {2{\sum\limits_{k = 1}^{{N/2} - 1}{c_{k}W_{N}^{{- k}\quad\mu}}}} + {c_{N/2}{\mathbb{e}}^{j\quad\pi\quad\mu}}} \right)}.}}} & (2.11) \end{matrix}$

Flowchart 500 in FIG. 5 summarizes the interpolation between two sample points at an offset μ using a trigonometric polynomial, where the two data samples that are to be interpolated are part of a set of N-data samples (see FIG. 2). The flowchart is described as follows.

In step 502, a set of N-data samples are received having the two data samples that are to be interpolated.

In step 504, coefficients of a trigonometric polynomial are determined based on the set of N data samples, according to equation (2.9). In doing so, the N data samples are multiplied by a complex scaling factor W_(N) ^(kn) to generate a k^(th) coefficient for the trigonometric polynomial, wherein W_(N)=e^(−j2π/N), and wherein n represents an n^(th) data sample of said N data samples.

In step 506, the trigonometric polynomial is evaluated at the offset μ based on equation (2.10) or (2.11).

In step 508, the real part of the evaluated trigonometric polynomial is determined and represents the desired interpolation value 202 in FIG. 2.

There are three issues that are to be considered in evaluating an interpolation scheme: 1) accuracy of interpolation, 2) complexity of implementation and 3) latency. In following sections, the trigonometric interpolation method is compared to the traditional polynomial method, particularly the Lagrange interpolator, in all these categories.

2.3 Performance Comparisons

Let us first derive the impulse responses of the interpolators. With N samples, N an even integer, the Lagrange formula (2.1) is $\begin{matrix} {{y(\mu)} = {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{{y(n)}{{C_{n}(\mu)}.}}}} & (2.12) \end{matrix}$

In addition, the interpolation is performed in the center interval. Thus 0≦μ≦1. Let us define a new function f(t) such that f(μ−n)=C _(n)(μ),0≦μ<1,−N/2+1≦n<N/2.  (2.13)

Using the example of FIG. 3, defining t=μ−n, we have $\begin{matrix} {{f(t)} = \left( \begin{matrix} {{{C_{2}\left( {t + 2} \right)} - 2} \leq t < {- 1}} \\ {{{C_{1}\left( {t + 1} \right)} - 1} \leq t < 0} \\ {{C_{0}(t)} \leq t < 1} \\ {{{C_{- 1}\left( {t - 1} \right)}1} \leq t < 2} \\ {0\quad{{otherwise}.}} \end{matrix} \right.} & (2.14) \end{matrix}$

Thus, the Lagrange formula becomes $\begin{matrix} {{y(t)} = {{\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{{y(n)}{C_{n}(t)}}} = {\sum\limits_{n = {- \infty}}^{\infty}{{y(n)}{{f\left( {t - n} \right)}.}}}}} & (2.15) \end{matrix}$

Therefore, the approach to reconstruct the continuous signal using the Lagrange polynomial is in fact equivalent to applying an interpolation filter f(t) to the available samples, with f(t) being a piecewise polynomial. The interpolator's impulse response f(t) obtained from (2.14) is shown in FIG. 6A.

Taking the Fourier transform of f(t), we obtain its frequency response. This allows us to evaluate the interpolation accuracy by examining the frequency response of the interpolation filter. The frequency response 702 of the Lagrange cubic interpolator (N=4) is shown in FIG. 7A. The horizontal axis is the normalized frequency f/F_(S), with F_(S)=1/T_(S). An ideal frequency response should have value one in the passband (0≦f/F_(S)<0.5) and be zero in the stopband (f/F_(S)≧0.5).

For the interpolator using a trigonometric polynomial, we can express y(t) in terms of y(n) by substituting (2.9) into (2.10): $\begin{matrix} \begin{matrix} {{y(\mu)} = {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{c_{k}W_{N}^{{- k}\quad\mu}}}} + {\frac{1}{N}c_{N/2}\cos\quad\pi\quad\mu}}} \\ {= {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{\left( {\sum\limits_{n = {{{- N}/2} + 1}}^{{N/2} - 1}{{y(n)}W_{N}^{kn}}} \right)W_{N}^{{- k}\quad\mu}}}} +}} \\ {\frac{1}{N}\left( {\sum\limits_{n = {{{- N}/2} + 1}}^{{N/2} - 1}{{y(n)}W_{N}^{{({N/2})}n}}} \right)\cos\quad\pi\quad\mu} \\ {= {\frac{1}{N}{\sum\limits_{n = {{{- N}/2} + 1}}^{{N/2} - 1}{{y(n)}\left( {{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}W_{N}^{k{({n - \mu})}}} + {\left( {- 1} \right)^{n}\cos\quad\pi\quad\mu}} \right)}}}} \\ {= {\frac{1}{N}{\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{y(n)}}}} \\ {\left( {1 + {2{\sum\limits_{k = 1}^{{N/2} - 1}{\cos\quad\frac{2\quad\pi\quad k}{N}\left( {\mu - n} \right)}}} + {\cos\quad{\pi\left( {\mu - n} \right)}}} \right).} \end{matrix} & (2.16) \end{matrix}$ Defining $\begin{matrix} {{f(t)} = \left( \begin{matrix} {{1 + {2{\sum\limits_{k = 1}^{{N/2} - 1}{\cos\quad\frac{2\quad\pi\quad k}{N}t}}} + {\cos\quad\pi\quad t{t}}} \leq {N/2}} \\ {{0{t}} > {N/2}} \end{matrix} \right.} & (2.17) \end{matrix}$ we have $\begin{matrix} {{y(\mu)} = {{\frac{1}{N}{\sum\limits_{n = {- \infty}}^{\infty}{{y(n)}{f\left( {\mu - n} \right)}}}} = {\frac{1}{N}{y \otimes {f_{\mu}.}}}}} & (2.18) \end{matrix}$

The impulse response f(t) in (2.17) is shown in FIG. 6B. The corresponding frequency response 704 of the trigonometric interpolator (for N=4) is shown in FIG. 7A in thin lines.

By comparing the frequency responses of the two interpolators, we can see that the trigonometric interpolation response 704 has a sharper roll-off in the transition band and more rapid attenuation in the stopband than the Lagrange response 702. These traits are enhanced as N increases, as demonstrated in FIG. 7B. For N=32, the trigonometric response 708 has a sharper rolloff than the Lagrange response 706 as shown in FIG. 7B.

Next we verify these observations by interpolating the samples of a practical time-domain signal. As an example, we interpolate a baseband signal with raised cosine spectrum and roll-off factor α=1.0, sampled at two samples per symbol period, as shown in FIG. 8A.

The interpolation accuracy here is measured as the normalized mean-squared difference between the signal interpolated with an ideal interpolator and the signal interpolated with the practical interpolator. The normalized mean-squared error (NMSE), discussed above, is calculated for both the Lagrange interpolator and the trigonometric interpolator for a range of typical values of N. The results are plotted in FIG. 8B.

Our test results demonstrate that the performance is improved with the trigonometric method. Using the same number of samples to interpolate, the proposed method produces a smaller NMSE, and the performance gain becomes greater as the number of samples increases.

2.4 Efficient Implementation Structures

Recalling from Section 2.2, the trigonometric interpolation algorithm includes substantially two steps:

Step 1. Given a number of data samples N, calculate the Fourier coefficients c_(k), k=0, . . . , N/2 using (2.9). In a preferred embodiment, an even number of N data samples are used. In other embodiments, an odd number of data samples are used.

Step 2. Compute the synchronized sample y([) for any given [according to (2.11).

The first step involves multiplying the data samples by complex scaling factors W_(N) ^(kn). Since these factors lie on the unit circle, the computation in Step 1 can be simplified. Let us examine the case when N=4:

Example 2.1: For N=4, the Fourier coefficients are obtained as: c ₀ =y(−1)+y(0)+y(1)+y(2) c ₁ =[y(0)−y(2)]+j[−y(1)+y(−1)] c ₂ =y(0)−y(1)+y(2)−y(−1).  (2.19)

As seen in (2.19), there is no nontrivial scaling multiplier required for N=4.

Example 2.2: We now compute the coefficients c_(k) in (2.9) for N=8. Using the trigonometric identities, we can obtain the following simple form for c_(k), k=0, . . . , 4: $\begin{matrix} {{c_{0} = {{y\left( {- 3} \right)} + {y\left( {- 2} \right)} + {y\left( {- 1} \right)} + {y(0)} + {y(1)} + {y(2)} + {y(3)} + {y(4)}}}\begin{matrix} {c_{1} = {\left\{ {{y(0)} - {y(4)} + {\left\lbrack {\underset{\_}{{- {y\left( {- 3} \right)}} + {y(1)}} + \underset{\_}{{y\left( {- 1} \right)} - {y(3)}}} \right\rbrack{\cos\left( {\pi/4} \right)}}} \right\} +}} \\ {j\left\{ {{y\left( {- 2} \right)} - {y(2)} + {\left\lbrack {\underset{\_}{{y\left( {- 3} \right)} - {y(1)}} + \underset{\_}{{y\left( {- 1} \right)} - {y(3)}}} \right\rbrack{\cos\left( {\pi/4} \right)}}} \right\}} \end{matrix}{c_{2} = {\left\{ {{- {y\left( {- 2} \right)}} + {y(0)} - {y(2)} + {y(4)}} \right\} + {j\left\{ {{- {y\left( {- 3} \right)}} + {y\left( {- 1} \right)} - {y(1)} + {y(3)}} \right\}}}}\begin{matrix} {c_{3} = {\left\{ {{y(0)} - {y(4)} + {\left\lbrack {{y\left( {- 3} \right)} - {y(1)} + \left( {{- {y\left( {- 1} \right)}} + {y(3)}} \right)} \right\rbrack{\cos\left( {\pi/4} \right)}}} \right\} +}} \\ {j\left\{ {{- {y\left( {- 2} \right)}} + {y(2)} + {\left\lbrack {{y\left( {- 3} \right)} - {y(1)} + \left( {{- {y\left( {- 1} \right)}} - {y(3)}} \right)} \right\rbrack{\cos\left( {\pi/4} \right)}}} \right\}} \end{matrix}{c_{4} = {{- {y\left( {- 3} \right)}} + {y\left( {- 2} \right)} - {y\left( {- 1} \right)} + {y(0)} - {y(1)} + {y(2)} - {y(3)} + {{y(4)}.}}}} & (2.20) \end{matrix}$

The only non-trivial scaling multiplications are those multiplications by cos (π/4). It appears that four such multiplications are needed to compute all the complex coefficients c_(k), k=0, . . . , 4. However, if we examine the data being multiplied by cos (π/4) (those terms embraced by the [ ] brackets), we observe that they are either the sums or differences of the [y(−3)−y(1)] and [y(−1)−y(3)] values. Therefore, we can compute [y(−3)−y(1)] cos(πE/4) and [y(−1)−y(3)]cos(π/4), then use these two products to generate the c_(n) coefficients. Thus, only two scaling multiplications are needed in computing all the coefficients.

Having observed the simplicity in the first step, let us focus on the second step. The second step may look complicated because of the complex multiplications c_(k)W_(N) ^(−kμ) and c_(N/2)e^(jπμ). However, since |W_(N) ^(−kμ)|=|e^(jxμ)|=1, these products are just rotations of points c_(k) and c_(N/2) in the complex plane. Furthermore, this is the same type of operation performed in the phase rotation for carrier recovery by the phase rotator 124 that is shown in FIG. 1D. This suggests that we can reduce the total complexity of the synchronization circuitry by sharing some resources needed by the digital resampler 122 and the carrier phase rotator 124. In one embodiment, a lookup table is utilized to determine the angle rotation associated with the angle $\frac{2\pi}{N}k\quad\mu$ for rotation of the c_(k) coefficients. In another embodiment, an angle rotator processor is utilized. Both embodiments are discussed further below, and the angle rotator processor is discussed in detail in section 5.

FIG. 10 illustrates a trigonometric interpolator 1000 that is one circuit configuration that implements the trigonometric interpolator equations (2.8)-(2.11), where the number of data samples is N=4. The interpolator 1000 is not meant to be limiting, as those skilled in the arts may recognize other circuit configurations that implement the equations (2.8)-(2.11). These other circuit configurations are within the scope and spirit of the present invention.

The trigonometric interpolator 1000 receives input data samples having two data samples that are to be interpolated at an offset μ (see FIG. 2). The resulting interpolated value y(μ) represents the interpolated point 202 in FIG. 2. The interpolator 1000 includes a delay module 1004, an adder/subtractor module 1006, and an angle rotator module 1008, and an adder 1012.

The delay module 1004 includes one or more delay elements 1012. The delay elements 1012 can be configured using known components.

The adder/subtractor module 1006 includes multiple adders (or subtractors) 1014, where subtraction is indicated by a (−) sign.

The angle rotator module includes two angle rotators 1010. The angle rotators 1010 can be configured using an angle rotator processor or a table lookup (e.g. read only memory) as discussed below.

The operation of the trigonometric interpolator 1000 is discussed further in reference to the flowchart 1700 in FIG. 17, which is discussed below.

In step 1702, the interpolator 1000 receives a set of N-input data samples. The N-data samples include the two data samples that are to be interpolated at the offset t relative to one of the data samples, as shown in the FIG. 2. In FIG. 2, the interpolation is to be performed between y(0) and y(1) at the offset μ to determine the interpolation value 202.

In step 1704, the delay module 1004 delays the input data samples.

In step 1706, the adder/subtractor module 1006 generates one or more trigonometric coefficients according to the equation (2.9). In FIG. 10, the coefficients are represented by C₀, C₁, and C₂ for N=4, where the coefficient C₁ is a complex coefficient.

In step 1708, the angle rotators 1010 rotate appropriate real and complex coefficients in a complex plane according the offset μ, resulting in rotated complex coefficients. More specifically, the angle rotator 1010 a rotates the real coefficient C₂, and the angle rotator 1010 b rotates the complex coefficient C₁ in the complex plane.

In embodiments, as discussed herein, the angle rotators 1010 are table look-ups. In which case, a rotation factor is retrieved from the table lookup based on the offset μ, where the rotation factor includes the evaluated cosine and sine functions of $\frac{2\pi}{N}k\quad\mu$ that are shown in the equations (2.21) below. The rotation factor is then multiplied by the corresponding real or complex coefficient, to generate the respective rotated complex coefficient. An interpolator 1800 having a table lookup ROM 1802 and a complex multiplier 1804 are shown in FIG. 18 for illustration.

In step 1710, the adder 1012 adds together C₀, a real part of the rotated coefficient C₁, and a real part of the rotated coefficient C₂. The adder 1012 also scales the output of the adder as necessary according to equation 2.10. The resulting value is the desired interpolation value at the offset μ, as represented by point 202 in FIG. 2.

The trigonometric interpolator is not limited to the 4th degree embodiment that is shown in FIG. 10. The trigonometric interpolator can be configured as an N^(th) degree interpolator based on N-data points, as represented by the equations (2.9)-(2.11). These other N^(th) degree interpolators are within the scope and spirit of the present invention. For example and without limitation, FIG. 11 illustrates an interpolator 1100 having N=8. The trigonometric interpolator 1100 includes: a delay module 1102, an adder/subtractor module 1104 (having two scaling multipliers having coefficients cos (π/4)), an angle rotator module 1106, and an adder 1108 (having a ⅛ scale factor that is not shown). The operation of the interpolator 1100 will be understood by those skilled in the arts based on the discussion herein.

2.4.1 Using a Lookup Table

For carrier recovery, the phase correction is generally accomplished by looking up the sine and cosine values corresponding to the phase, then by multiplying these values with the complex data. This requires the same operations as the rotation of c_(k) by an angle ${\frac{2\pi}{N}k\quad\mu},$ , that is: $\begin{matrix} {{{{Re}\left( {c_{k}W_{N}^{{- k}\quad\mu}} \right)} = {{{{Re}\left( c_{k} \right)}\cos\quad\frac{2\quad\pi}{N}k\quad\mu} - {{{Im}\left( c_{k} \right)}\sin\quad\frac{2\quad\pi}{N}k\quad\mu}}}{{{Im}\left( {c_{k}W_{N}^{{- k}\quad\mu}} \right)} = {{{{Re}\left( c_{k} \right)}\sin\quad\frac{2\quad\pi}{N}k\quad\mu} + {{{Im}\left( c_{k} \right)}\cos\quad\frac{2\quad\pi}{N}k\quad{\mu.}}}}} & (2.21) \end{matrix}$

The sine and cosine table can be used for both the resampler, as in (2.21), and the phase rotator for carrier recovery. In embodiments, a read only memory (ROM) is utilized as the lookup table. However, other embodiments could be utilized in including other types of memories. An interpolator 1800 utilizing a table lookup ROM 1802 and complex multiplier 1804 are shown in FIG. 18 for illustration. The ROM table access time is insignificant as compared to the computation time in other parts of the interpolator. Therefore, this method results in low hardware complexity and low computational delay. This implementation will be referred to as the table-lookup method.

2.4.2. Using an Angle Rotation Processor

When a very low complexity implementation is desired at the expense of a slight increase in computational delay, we propose to use an efficient structure for angle rotation, which is described in Section 5. Based on this structure, each angle rotator has a hardware complexity slightly greater than that of two multipliers. In addition, a very small ROM is needed. We will subsequently refer to this particular implementation of our algorithm as the angle-rotation method.

Thus, there are at least two choices for implementing (2.21) as well as the phase rotator for carrier recovery. The trade-off is between complexity and speed. In a base-station where computation power is more affordable, the table lookup method might be used. In a hand-set, where cost is a major concern, an angle rotation processor might be used for both the resampler and the phase rotator, multiplexing the operations.

Now let us compare the complexity of the trigonometric resampler with that of the Lagrange method. Table 2.1 summarizes the comparisons for several typical N values. The numbers are based on the table-lookup method. It indicates that, for the same filter length N the trigonometric interpolation method needs less hardware. TABLE 2.1 Complexity and latency comparisons. N 4 6 8 10 Nontrivial scaling Lagrange 2 10 25 39 multipliers Data multipliers Trigonometric 0 2 6 16 Lagrange 3 5 7 9 Multiplications in the Trigonometric 3 5 7 9 critical path Lagrange 4 6 8 10 Trigonometric 1 2 2 2 2.5 Delays in the Computation

The critical path of the Farrow structure 400 (FIG. 4) is now compared to that of the trigonometric interpolator. The Farrow structure implements the Lagrange interpolator as discussed above. The Farrow structure 400 is shown in FIG. 9 (or FIG. 4), with the critical path 902 indicated. The critical path 902 for this structure includes one scaling multiplier 904 and N−1 data multipliers 906.

In contrast, the critical path for the trigonometric interpolator 1000 is path 1002 and it contains just one angle rotation 1010, or only one multiplier if the table-lookup method is employed to replace the angle rotator 1010. Since the angle rotations for various angles can be carried out in parallel, the critical path does not lengthen as N increases.

Table 2.1 compares the computational delays for the trigonometric interpolator with that of the Lagrange interpolator for various values of N. The delay data for the trigonometric interpolator 1000 are based on the table-lookup method. As shown in FIG. 10, the trigonometric interpolator (for N=4) has only one multiplier in the critical path, whereas the Lagrange interpolator has 4 multipliers in the critical path. Therefore, the trigonometric interpolator has less latency than the Lagrange interpolator, which is important for voice communications.

2.6 Simplifications of the Preliminary Structures

As mentioned in Section 2.4, to produce each y(μ) we first calculate the Fourier coefficients c_(k) using existing samples, according to (2.9). We then compute Re(c_(k)W_(N) ^(−kμ)) to be used in (2.11). This is accomplished either by retrieving W_(N) ^(−kμ) from a lookup table, followed by two real multiplications, or by an angle-rotation processor.

2.6.1 The Simplified Structure for N=4

Let us examine the trigonometric interpolator 1000 having N=4. To compute Re(2 c ₁W₄ ^(−μ)) and Re(c₂W₄ ^(−2μ)) the system requires either two angle rotators 1004 or two accesses to a lookup table.

If the input samples would happen to be such that c₂=0 then one fewer angle rotator, or one fewer ROM access, would be required. Of course, the original data samples y(−1), y(0), y(1), and y(2) are not likely to have the special property that c₂=y(0)−y(1)+y(2)−y(−1)=0. However, if the data samples are changed, then the modified samples can be determined to satisfy c₂=0. If the modified samples for interpolation, then the c₂ angle rotator 1010 a can be eliminated. However, the interpolation result will not then correspond to the original data samples.

It seems that the data samples can be changed to attain savings in hardware, as long as the interpolation result is fixed so that it corresponds to the original data samples. Of course, it must also cost less in hardware to “fix” the interpolation result than is saved in hardware by using the modified samples.

If the samples y(k) are modified to form {tilde over (y)}(k) according to: {tilde over (y)}(−1)=y(−1)−K {tilde over (y)}(0)=y(0) {tilde over (y)}(1)=y(1)+K {tilde over (y)}(2)=y(2)+2K  (2.22) then the K value can be adjusted to force the {tilde over (y)}(k) samples to satisfy c₂=0, where K is the slope of a straight line 1202 in FIG. 12.

To find K, the c₂ value that corresponds to the modified samples is determined according to: $\begin{matrix} \begin{matrix} {c_{2} = {{y(0)} - {y(1)} + {y(2)} - {y\left( {- 1} \right)}}} \\ {= {{y(0)} - \left( {{y(1)} + K} \right) + \left( {{y(2)} + {2\quad K}} \right) - \left( {{y\left( {- 1} \right)} - K} \right)}} \\ {= {{2\quad K} - {\left( {{y(1)} + {y\left( {- 1} \right)} - {y(0)} - {y(2)}} \right).}}} \end{matrix} & (2.23) \end{matrix}$ To force c₂=0, requires: $\begin{matrix} {K = {\frac{1}{2}\left( {{y(1)} + {y\left( {- 1} \right)} - {y(0)} - {y(2)}} \right)}} & (2.24) \end{matrix}$

Therefore, the c₂ angle-rotator can be eliminated, and c₀ and c₁ are determined accordingly as, c ₀=2(y(1)+y(−1)) c ₁=[2y(0)−y(1)−y(−1)]+j[−2y(1)+y(0)+y(2)].  (2.25)

Then, the interpolated sample is $\begin{matrix} {{\overset{\sim}{y}(\mu)} = {{\frac{1}{4}c_{0}} + {\frac{1}{2}{{{Re}\left( {c_{1}{\mathbb{e}}^{j\quad\frac{\pi}{2}\mu}} \right)}.}}}} & (2.26) \end{matrix}$

However, {tilde over (y)}(μ) should be adjusted so that it corresponds to the original samples. From FIG. 12, the values expressing the difference between the original and the modified samples lie on the straight line 1202. From FIG. 13, it follows that the offset due to the modification of samples is Kμ. Therefore, the {tilde over (y)}(μ) value can be compensated by: y(μ)={tilde over (y)}(μ)−Kμ.  (2.27)

Using equations (2.25), (2.26) and (2.27) leads to an interpolator 1400 as shown in FIG. 14. This simplified interpolator structure is not limited to N=4 configurations. In fact, this simplification technique can be applied to an interpolator with an arbitrary N value. To eliminate the angle-rotation needed by Re(c_(N/2)e^(jπμ)) in (2.11), the samples are modified according to {tilde over (y)}(n)=y(n)+nK,n=integer.  (2.28)

Using (2.9), and then applying (2.28), results in $\begin{matrix} \begin{matrix} {c_{N/2} = {\frac{1}{N}\left( {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{\left( {- 1} \right)^{n}{\overset{\sim}{y}(n)}}} \right)}} \\ {= {{\frac{1}{N}\left( {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{\left( {- 1} \right)^{n}{y(n)}}} \right)} + {\frac{1}{2}{K.}}}} \end{matrix} & (2.29) \end{matrix}$

If we choose $\begin{matrix} {K = {{- \frac{2}{N}}{\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{\left( {- 1} \right)^{n}{y(n)}}}}} & (2.30) \end{matrix}$

we can force c_(N/2)=0.

Referring to FIG. 14, the interpolator 1400 includes the delay module 1004, an adder/subtractor module 1402, the angle rotator 1010 b, a multiplier 1404, and an adder 1406. The interpolator 1400 has a simplified structure when compared the interpolator 1000 (in FIG. 10), as the interpolator 1400 replaces the angle rotator 1010 b with a multiplier 1404. As discussed above, this can be done because the coefficient C_(N/2)=0 (C₂=0 for N=4) by modification of the data samples, and therefore there is no need to have an angle rotator for C_(N/2). The operation of the interpolator 1400 is further discussed in reference to the flowchart 1900 that follows.

In step 1902, the interpolator 1400 receives a set of N input data samples. The N data samples include two of the data samples that are to be interpolated at the offset μ, as shown in the FIG. 2.

In step 1904, the delay module 1004 delays the input data samples.

In step 1906, the adder/subtractor module 1402 modifies one or more of the data samples so that a coefficient c_(N/2) is 0. In embodiments the data samples are modified according to y(n)_(mod)=y(n)+n·K, wherein K is determined by the equation (2.30) above so that c_(N/2) is 0, and wherein y(n) represents the n^(th) data sample of the N data sample set.

In step 1908, the adder/subtractor module 1402 generates one or more trigonometric coefficients according to modifications to the equation (2.9). In the N=4 case, equations (2.25) are implemented by the module 1402. In FIG. 14, for N=4, the coefficients are represented by C₀ and C₁, where the coefficient C₁ is a complex coefficient. By comparing with FIG. 10, it is noted that the C₂ coefficient is 0. Additionally, the adder/subtractor module 1402 outputs the K value for further processing. Notice also that in FIG. 14, the output scaling factor has been changed from ¼ to ½. This reflects several other straightforward simplifications that have been made to module 1402 and in the angle rotator 1101 b. In embodiments, the steps 1906 and 1908 are to be performed simultaneously by the adder/subtractor module 1402, as will be understood by those skilled in the relevant arts.

In step 1910, the angle rotator 1010 b rotates the complex coefficient C₁ in a complex plane according the offset μ, resulting in a rotated complex coefficient. In embodiments, as discussed herein, the angle rotator 1010 b is table look-up. In which case, a complex rotation factor is retrieved from the table lookup based on the offset μ, and the resulting rotation factor is then multiplied by the corresponding complex coefficient, to generate the respective rotated complex coefficient. The rotation factor includes the evaluation of the cosine and sine factors that are shown in equations (2.21). Note that since C₂=0, the angle rotator 1010 a is replaced with the multiplier 1404.

In the step 1912, the multiplier 1404 multiplies the K factor by the offset μ, to produce a Kμ factor.

In step 1914, the adder 1406 adds together C₀ and Kμ and a real part of the rotated complex coefficient C₁, and scales the sum by the trivial factor ½, to produce the desired interpolation value. The addition of the Kμ factor compensates the desired interpolation value for the modification that was done to the data samples in order to force c_(N/2) to zero in step 1906.

The simplified trigonometric interpolator is not limited to the four-sample embodiment that is shown in FIG. 14. The simplified trigonometric interpolator can be configured as an N-sample interpolator based on N data points, as represented by the equations (2.28)-(2.30). These other N-sample interpolators are within the scope and spirit of the present invention. For example and without limitation, an interpolator with N=8 is discussed below.

2.6.2. The Simplified Structure for N=8

According to (2.30), we choose $\begin{matrix} {K = {\frac{1}{4}{\left( {{y(1)} + {y(3)} + {y\left( {- 3} \right)} + {y\left( {- 1} \right)} - {y(0)} - {y(2)} - {y(4)} - {y\left( {- 2} \right)}} \right).}}} & (2.31) \end{matrix}$

The coefficient values can be computed following this procedure: p1=(4K+y(1)−y(−3))cos π/4 p2=(4K+y(3)−y(−1))cos π/4  (2.32) c ₀=2(y(1)+y(3)+y(−3)+y(−1)) c ₁ =[y(0)−y(4)−4K+p1−p2]+j[y(−2)−y(2)−4K−p1−p2] c ₂=[4K+y(0)+y(4)−y(2)−y(−2)]+j[4K+y(3)+y(−1)−y(1)−y(−3)] c ₃ =[y(0)−y(4)−4K−p1+p2]+j[−y(−2)+y(2)+4K−p1−p2] c₄=0.  (2.33)

The resulting modified structure for N=8 is shown in FIG. 15 as interpolator 1500. Similar to the interpolator 1400, the interpolator 1500 includes a delay module 1504, an adder/subtractor module 1506, an angle rotator module 1508, a multiplier 1510, and an output scaling adder 1512. As in the interpolator 1400, the multiplier 1510 substantially replaces an angle rotator module. As in the interpolator 1100 for N=8 (FIG. 11), only two non-trivial scaling multiplications are needed for the modified structure 1500.

2.6.3 Performance Comparisons with Other Structures

How does the simplified interpolator 1400 (FIG. 14) perform as compared to the interpolator 1000 (FIG. 10)? FIGS. 16A-C show the frequency responses, in solid lines, of the Lagrange cubic interpolator 400 (FIG. 4), the interpolator 1000 (FIG. 10) and the simplified interpolator 1400 (FIG. 14), respectively. For an input signal whose spectrum is a raised cosine with a=0.4, as shown in dashed lines, the amount of interpolation error corresponds to the gray areas. Clearly, the interpolator 1400 produces less error than the Lagrange cubic interpolator 400 and the interpolator 1000. (FIG. 16D will be discussed in Section 4.)

Next, let us verify this performance improvement by interpolating two signals: Signal 1, which is the same as signal 802 in FIG. 8A (α=1.0), and Signal 2, which is signal 1602 in FIG. 16 (α=0.4). Then, the NMSE values are compared. We use three interpolators: 1) Lagrange cubic interpolator 400; 2) the trigonometric interpolator 1000; and 3) and the trigonometric interpolator 1400. Also compared is the number of multipliers.

The results in Table 2.2 show that the modified structure for N=4 not only requires less hardware, it also obtains the highest accuracy among the three methods for these practical signals used in our simulation. TABLE 2.2 Comparison of interpolators for N = 4. Lagrange Structure in Structure in N = 4 cubic NMSE for Signal 1 in dB −25.80 −28.45 −29.41 NMSE for Signal 2 in dB −31.08 −31.21 −33.51 Nontrivial scaling 2 0 0 multipliers Data multipliers 3 * * Multipliers in critical path 4 2 2 * The trigonometric interpolator 1000 employs two one-output angle-rotators, each having the hardware equivalent of slightly more than two multipliers. The trigonometric interpolator 1400 employs one such angle-rotator and one multiplier yielding an equivalent of slightly more than three multipliers. 2.7. Trigonometric Interpolator Application

An important application of the interpolation method and apparatus described in this patent is the following. It is often necessary to increase the sampling rate of a given signal by a fixed integer factor. For example, a signal received at a rate of 1000 samples per second might need to be converted to one at a rate of 4000 samples per second, which represents an increase of the sampling rate by the integer factor four. There are methods in common practice for doing such a conversion. One method is a very popular two-step process wherein the first step creates a signal at the desired higher sampling rate but one where simple zero-valued samples (three of them in the example situation just mentioned) are inserted after each input data value. The second step in the interpolation scheme is to pass this “up-sampled” or “data-rate expanded” signal through an appropriately designed lowpass digital filter which, in effect, smoothes the signal by “filling in” data values at the previously inserted zero-valued samples. In the process of doing this filtering operation it might or might not be important that the original data samples remain intact, and when this is important there exist certain special lowpass filters that will not alter those samples.

We can easily adapt the trigonometric interpolator described herein to efficiently create such a sampling rate conversion system, but one that does not require such filtering operations. If we denote the integer factor by which we desire to increase the data rate as L (in the above example, L=4) we proceed as follows. We build the system 7800 shown below in FIG. 78. System 7800 includes a Delay Module 7802 and Add/Subtract Module 7804 (that are similar to those in FIG. 10), and such that it can accommodate incoming data at a rate r. We now build L copies of the Angle-Rotation Module 7806 (similar to that in FIG. 10), with each one being fed by the same outputs of the Add/Subtract Module. Within each of these L Angle-Rotation Modules 7806 we fix the t value; that is, each one has a different one of the values: 1/L, 2/L, . . . , (1−L)/L. With such fixed μ values, each Angle-Rotation Module 7806 can be constructed as a set of fixed multipliers (a very special case of the table-lookup method), although any of the Angle-Rotation Module implementations previously discussed can be employed.

As shown in FIG. 78, the L-1 outputs, i.e., the interpolated samples that are offset by the values 1/L, 2/L, . . . , (L-1)/L from the first of the two data points (indicated as μ=0 and μ=1 in the Delay Module of FIG. 78) are routed to a multiplexer 7808, along with the input data point from which all interpolated samples are offset. The multiplexer 7808 simply selects these samples, in sequence, and provides them to the output at the expanded data rate L×r.

A major advantage of the system 7800 is that all of the system's components are operated at the (slow) input data rate except the output multiplexer 7808. If desired, it would also be possible to employ fewer Angle-Rotation Modules 7806, but operating them at a higher data rate, and using several t values, sequentially, for each. This would result in a system that employed less hardware but one that traded off the hardware savings for a higher data rate operation of such modules.

2.8 Trigonometric Interpolator Summary

In this Section we have described an interpolation method that we have devised that uses trigonometric series for interpolation. Comparing the interpolations using the trigonometric polynomial and the Lagrange polynomial of the same degree, the trigonometric-based method achieves higher interpolation accuracy while simultaneously reducing the computation time and the amount of required hardware. Moreover, the trigonometric-based method performs operations that are similar to those of a phase rotator for carrier phase adjustment. This allows a reduction in the overall synchronization circuit complexity by sharing resources.

This trigonometric interpolator yields less computational delay, as compared to algebraic interpolators. To achieve the same throughput rate, this translates into more savings in hardware using the proposed structure, because the data registers that are required by algebraic interpolators to pipeline the computation for a faster rate would not be needed by our structure.

We have also introduced two implementations of the trigonometric interpolation method: one using a lookup table, and one using an angle rotation processor (to be discussed in Section 5).

After introducing a first interpolation method, we have shown that we can trade one angle rotator for a multiplier by conceptually modifying the input samples, then by “correcting” the interpolated value obtained from the “modified” samples. Through this modification, we have obtained a simpler implementation structure while simultaneously improving the performance when interpolating most practical signals. This performance improvement has been demonstrated by comparing the frequency responses of the interpolators and the mean-squared interpolation errors using these interpolators. Our discussion of the optimal digital resampler in Section 4 will be based on this simplified interpolator.

3. INTERPOLATION FILTERS WITH ARBITRARY FREQUENCY RESPONSE

In Section 2, an interpolation method using a trigonometric polynomial was introduced, along with an example of such an interpolation structure of length N=4. In addition to being a very simple structure, our analyses and simulations also demonstrated that the trigonometric interpolator outperformed the interpolator of the same length using a Lagrange polynomial. In this Section, a more systematic approach will be taken to analyze this method from the digital signal processing point of view. A formula giving its impulse response allows us to analyze the frequency response of the interpolation filter. We then show how to modify the algorithm to achieve arbitrary frequency response. The discussions in this Section will provide the framework for the optimal interpolator of Section 4.

3.1 Formulating the Trigonometric Interpolator as an Interpolation Filter

We have shown that, given N equally-spaced samples y(n), a continuous-time signal can be reconstructed as $\begin{matrix} {{y(t)} = {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{{y(n)}{f\left( {t - n} \right)}}}} & (3.1) \end{matrix}$ where f(t) is the impulse response of a continuous-time interpolation filter. As in Section 2, it is assumed that the sampling period is T_(s)=1. This assumption makes the notation simpler and the results can easily be extended for an arbitrary T_(s). In other words, the invention is not limited to a sampling period of T_(s)=1, as other sampling periods could be utilized. In Section 2 we have shown that f(t) can be expressed as: $\begin{matrix} {{f(t)} = \left( \begin{matrix} {{1 + {2{\sum\limits_{k = 1}^{{N/2} - 1}{\cos\quad\frac{2\quad\pi}{N}k\quad t}}} + {\cos\quad\pi\quad t{t}}} \leq {N/2}} \\ {{0{t}} > {N/2.}} \end{matrix} \right.} & (3.2) \end{matrix}$ FIG. 20 illustrates f for the trigonometric interpolation filters for N=8 and N=16. By computing the Fourier transform of f we obtain the frequency response of the interpolation filter. The frequency responses for the N=8 and N=16 cases are plotted in FIG. 21. Since f(t) is real and symmetric around t=0, its frequency response has zero phase. In FIG. 21, the oscillatory behavior near the band edge is quite obvious. In addition, by comparing FIGS. 21 a and b, we can see that as the filter length is increased from N=8 to N=16 the amount of ripple does not decrease. Well known as the Gibbs phenomenon, the magnitude of the ripples does not diminish as the duration of the impulse response is increased.

It is apparent that the amount of oscillation cannot be reduced using the method discussed thus far while only increasing the filter length N. Moreover, it seems that an arbitrary frequency response cannot be achieved using this method. To address these problems, let us examine how the frequency response of this method is determined.

3.2. Analysis of the Frequency Response

Let us examine how the frequency response off for the trigonometric interpolator is obtained using the example in FIG. 22 with N=8. According to (3.2), the interpolation filter's impulse response f(t) on the interval ${- \frac{N}{2}} \leq t \leq \frac{N}{2}$ is a weighted sum of cosine functions. We can view the finite-length filter f in (3.2) as having been obtained by applying a window 2206 according to the following: $\begin{matrix} {{w(t)} = \left\{ \begin{matrix} {{1{t}} \leq {N/2}} \\ {{0{t}} > {N/2}} \end{matrix} \right.} & (3.3) \end{matrix}$ to an infinitely-long, periodic function 2204 with period N: $\begin{matrix} \begin{matrix} {{f_{c}(t)} = {{1 + {2{\sum\limits_{k = 1}^{{N/2} - 1}{\cos\frac{\quad{2\quad\pi}}{N}k\quad t}}} + {\cos\quad\pi\quad t} - \infty} < t < \infty}} \\ {= {{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}W_{N}^{k\quad t}} + {\frac{1}{2}W_{N}^{{- {({N/2})}}t}} + {\frac{1}{2}W_{N}^{{({N/2})}t}}}} \end{matrix} & (3.4) \end{matrix}$ such that f(t)=f _(c)(t)w(t),−∞<t<∞.  (3.5) Thus F the frequency response off can be obtained by convolving F_(c) and W the Fourier transforms of f_(c) and w, respectively. The Fourier transform of the periodic function f_(c)(t), −∞<t<∞, is $\begin{matrix} {{F_{c}(\Omega)} = {{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{\delta\left( {\Omega - {\frac{2\quad\pi}{N}k}} \right)}} + {\frac{1}{2}{\delta\left( {\Omega - \pi} \right)}} + {\frac{1}{2}{\delta\left( {\Omega + \pi} \right)}}}} & (3.6) \end{matrix}$ which consists of a sequence of impulses 2208. We will subsequently refer to the weights of these impulses as frequency samples. Denoting the weight of $\delta\left( {\Omega - {\frac{2\quad\pi}{N}k}} \right)$ by {circumflex over (F)}(k), we have $\begin{matrix} {{F_{c}(\Omega)} = {\sum\limits_{k = {- M}}^{M}{{\hat{F}(k)}{\delta\left( {\Omega - {\frac{2\quad\pi}{N}k}} \right)}}}} & (3.7) \end{matrix}$ where $M \geq \frac{N}{2}$ is an integer. In the case of (3.6), $M = {\frac{N}{2}.}$ For our particular interpolation filter, according to (3.6), all in-band frequency samples {circumflex over (F)}(k)=1 for |k|<N/2. For |k|>N/2, the out-of-band samples {circumflex over (F)}(k)=0. The two samples in the transition band are {circumflex over (F)}(N/2)={circumflex over (F)}(−N/2)=½. The transition bandwidth is determined by the distance between the last in-band, and the first out-of-band frequency samples.

Since w is a rectangular function, W must be a sinc function 2210. Convolving F^(c) and the sinc function W simply interpolates the frequency samples to obtain F(Ω), −∞<Ω<∞, shown as response 2212. (Here we have plotted the symmetric {circumflex over (F)}(k) only on the positive half of the Ω axis.) We thus have $\begin{matrix} {{{\hat{F}(k)} = \left. {F(\Omega)} \right|_{\Omega = {2\pi\quad{k/N}}}},{{- \frac{N}{2}} \leq k \leq {\frac{N}{2}.}}} & (3.8) \end{matrix}$ From response 2212, the continuous-frequency response F(Ω) is uniquely determined by an infinite number of equally spaced frequency samples {circumflex over (F)}(k) If we modify the frequency samples 2214 near the passband edge to let the transition between the passband and stopband be more gradual, as depicted in FIG. 23, then the ripple is decreased. FIG. 23 demonstrates gradually reduced samples 2302, and the reduction of ripples in the overall response 2304, as compared to the response 2212 in FIG. 22. The cost of this improvement is an increased transition bandwidth in the response 2304, as compared to the response 2212.

If a narrower transition band is desired, we can increase the duration of the filter f(t). This can be seen by comparing FIG. 24, where N=16, with response 2304 in FIG. 23, in which N=8.

3.3. Implementing the Modified Algorithm

By comparing (3.6) and (3.4) we can see that the frequency sample values, i.e., the weights of the impulses in (3.6), are determined by the weights in the sum in (3.4).

We can modify our original interpolation filter in (3.2) for |t|≦N/2 as $\begin{matrix} {{f_{m}(t)} = {{\hat{F}(0)} + {2{\sum\limits_{k = 1}^{M}{{\hat{F}(k)}\cos\quad\frac{2\pi}{N}{{kt}.}}}}}} & (3.9) \end{matrix}$ By expressing (3.9) using the W_(N) notation, for |t|≦N/2 we have $\begin{matrix} {{f_{m}(t)} = {{{{\hat{F}(0)}W_{N}^{0\quad t}} + {\sum\limits_{k = 1}^{M}{{\hat{F}(k)}\left( {W_{N}^{kt} + W_{N}^{- {kt}}} \right)}}} = {\sum\limits_{k = {- M}}^{M}{{\hat{F}(k)}{W_{N}^{- {kt}}.}}}}} & (3.10) \end{matrix}$ and f_(m)(t)=0 for |t|>N/2. Substituting this result into (3.1), and re-ordering terms, we have $\begin{matrix} {{y(t)} = {\frac{1}{N}{\sum\limits_{k = {- M}}^{M}{{\hat{c}}_{k}W_{N}^{- {kt}}}}}} & (3.11) \end{matrix}$ where $\begin{matrix} {{\hat{c}}_{k} = {{\hat{F}(k)}{\left( {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{{y(n)}W_{N}^{kn}}} \right).}}} & (3.12) \end{matrix}$

By comparing (3.12) to (2.9), we can see that, for ${k = {{- \frac{N}{2}} + 1}},\ldots\quad,\frac{N}{2},$  ĉ _(k) ={circumflex over (F)}(k)c _(k).  (3.13)

Thus, a modified algorithm can be implemented as the following steps:

Step 1′. (Same as Step 1 in Section 2.4): Given an even number of samples N, calculate the Fourier coefficients c_(k), k=0, . . . ,N/2 using (2.9).

Step 2′: Multiply the coefficients c_(k) by scale factors {circumflex over (F)}(k) using (3.13).

Step 3′: Given a fractional delay μ, compute the synchronized samples using (3.11), which, due to ĉ*_(k)=ĉ_(−k), can be simplified as: $\begin{matrix} {{y(\mu)} = {\frac{1}{N}{Re}\quad{\left( {{\hat{c}}_{0} + {2{\sum\limits_{k = 1}^{M}{{\hat{c}}_{k}W_{N}^{{- k}\quad\mu}}}}} \right).}}} & (3.14) \end{matrix}$ It seems that, in Step 3′, we need coefficients ĉ(k) (hence c_(k)) not only for k≦N/2 but also for k>N/2 while only c_(k) values for k≦N/2 are computed in Step 1′. However, c_(k) values for k>N/2 can be obtained using c _(k) =c _(k−mN)  (3.15) where m is an integer such that 0≦k−mN≦N/2. We have (3.15) because c_(k) is periodic in k with period N, because c_(k) is obtained from the Fourier transform of the discrete-time signal y(n), −N/2+1≧n≧N/2.

At this point, we have shown that the continuous-time frequency response of the interpolation filter having impulse response f(t) can be improved by modifying the weights {circumflex over (F)}(k) in (3.10). Now a question arises: the modification of the weights would alter the shape of the impulse response of the f(t) filter. How do we guarantee that the resulting filter does not change the original samples?

3.4 Conditions for Zero ISI

In order for f(t) not to alter the original samples when used for interpolation as in (3.1), it must have zero-crossings at integer multiples of the sampling period: $\begin{matrix} {{f(n)} = \left\{ \begin{matrix} {{1n} = 0} & \quad \\ {{{0n} \neq 0},} & {n\quad{an}\quad{{integer}.}} \end{matrix} \right.} & (3.16) \end{matrix}$ The well-known Nyquist condition for zero ISI (Proakis, J. G., Digital Communications, McGraw-Hill, New York, N.Y. (1993)) states that the necessary and sufficient condition for (3.16) is $\begin{matrix} {{\sum\limits_{n = {- \infty}}^{\infty}{F\left( {\Omega - {2\pi\quad n}} \right)}} = {{1 - \infty} < \Omega < {\infty.}}} & (3.17) \end{matrix}$ Since the filter's impulse response f(t) has a finite duration, i.e. f(t)=0 for |t|>N/2, (3.16) holds if and only if the frequency samples {circumflex over (F)}(k) satisfy $\begin{matrix} {{{\sum\limits_{n = {- \infty}}^{\infty}{\hat{F}\left( {k - {Nn}} \right)}} = 1},{k = {{integer}.}}} & (3.18) \end{matrix}$ The proof is given in Appendix A.

In summary, we can still guarantee that the modified interpolation filter f does not alter the original samples as long as the modified weights {circumflex over (F)}(k) (frequency samples) satisfy (3.18). Using this constraint, we can design the weights {circumflex over (F)}(k) to meet given frequency response requirements.

3.5. Optimization Algorithm

Using the approach discussed, one can approximate an arbitrary frequency response by choosing appropriate weights {circumflex over (F)}(k). For example, a desired frequency response F_(d)(Ω) for an interpolation filter should be unity in the passband and be zero in the stopband, as $\begin{matrix} {{F_{d}(\Omega)} = \left\{ \begin{matrix} {{1 - \frac{\pi}{2}} \leq \Omega \leq \frac{\pi}{2}} \\ {{0{\Omega }} > {\pi.}} \end{matrix} \right.} & (3.19) \end{matrix}$ The interpolation error using our interpolation filter is defined as e(Ω)=W _(t)(Ω)|F _(d)(Ω)−F(Ω)  (3.20) where W_(t)(Ω) is a weighting function.

From Section 3.2 we have F(Ω)=F_(c)(Ω){circle around (×)}sinc(Ω). Thus, we can express F(Ω) in terms of {circumflex over (F)}(k), using (3.7), as $\begin{matrix} \begin{matrix} {{F(\Omega)} = {{\left( {\sum\limits_{k = {- M}}^{M}{{\hat{F}(k)}{\delta\left( {\Omega - \frac{2\pi}{N}} \right)}}} \right) \otimes \sin}\quad{c(\Omega)}}} \\ {= {\sum\limits_{k = {- M}}^{M}{{\hat{F}(k)}\quad\sin\quad{{c\left( {\Omega - {\frac{2\pi}{N}k}} \right)}.}}}} \end{matrix} & (3.21) \end{matrix}$

An optimal interpolation filter can be designed by choosing {circumflex over (F)}(k) to minimize the peak interpolation error, as $\begin{matrix} {L_{\infty} = \begin{matrix} {\max\left\{ {e(\Omega)} \right\}} \\ \Omega \end{matrix}} & (3.22) \end{matrix}$ or the mean-squared interpolation error L ₂=∫_(−∞) ^(∞) e ²(Ω)dΩ  (3.23) subject to the constraint described by (3.18).

By examining FIGS. ?23 and 24?, we can see that, by modifying only two frequency samples, those nearest the band edge, a significant improvement is achieved. In these cases we have {circumflex over (F)}(k)=0 for |k|>N/2+1.

3.6 Conclusion

In this Section, an interpolation method was presented that achieves arbitrary frequency response by modifying the trigonometric interpolator discussed in Section 2. Using this approach, the performance of a trigonometric interpolation filter can be further improved.

It is interesting to note that this procedure is equivalent to the well-known filter design method using windows. FIG. 25 a depicts the impulse responses of the original filter (3.2) as the dashed line, and the modified filter (3.9) as the solid line. By comparing the two impulse responses, we have found a function illustrated in FIG. 25 b. If we multiply the original impulse response by this function, we get the impulse response that we obtained by modifying the frequency samples. Therefore, this function is equivalent to a window. According to this interpretation, our frequency domain design method is equivalent to designing a better window than the rectangular window (3.3) in the time domain.

4. DESIGN OF OPTIMAL RESAMPLERS

4.1 Motivation

We have thus far discussed digital resampling using interpolation methods. To accomplish this, we conceptually reconstruct the continuous-time signal by fitting a trigonometric polynomial to the existing samples and then re-sample the reconstructed signal by evaluating this polynomial for a given sampling mismatch (or offset) μ. The reconstruction of the continuous-time bandlimited signal y(t) from existing samples y(m) using interpolation filter f(t), according to (3.1), is $\begin{matrix} {{y(t)} = {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}{{f\left( {t - m} \right)}.}}}} & (4.1) \end{matrix}$ Then y is resampled at t=μ as $\begin{matrix} {{y(\mu)} = {{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}{f\left( {\mu - m} \right)}}} = {y \otimes f_{\mu}}}} & (4.2) \end{matrix}$ where f_(μ)(m)=f(m−μ).

In the previous sections we approached the problem only from the point of view of reconstructing the continuous-time signal, as in (4.1), since we have only examined the frequency response of the continuous-time filter f(t). However, what we actually are interested in is the new sample y(μ) that is obtained by resampling the continuous-time signal at a new sampling instant, t=μ.

Now, a question arises: Even when the frequency response F(Ω) of the continuous-time filter is optimized as in Section 3.5, do we necessarily obtain the minimum error in producing a new sample y(μ) for each μ value?

According to (4.2), the new sample y(μ) is actually obtained by filtering the original samples y(m) using a discrete-time filter whose impulse response f_(μ)(m) depends on a particular delay μ. What is the desired frequency response of the f_(μ)(m) filter?

A digital resampler that is used in timing recovery simply compensates for the timing offset in sampling the received signal. Ideally, the f_(μ)(m) filter should not alter the signal spectrum as it simply delays the existing samples by μ. Obviously, the desired frequency response of the discrete-time f_(μ)(m) filter is F _(d)(ω,μ)=e ^(jωμ)  (4.3) where ω is the normalized angular frequency. Let us define the frequency response of f_(μ)(m) as F_(μ)(ω). The error in approximating the ideal frequency response F_(d)(ω, μ) by F_(μ)(ω) for a given μ value, is e(ω)=W _(t)(ω)|F_(d)(ω, μ)−F _(μ)(ω)|  (4.4) where W_(t)(ω) is a weighting function.

We now examine how the discrete-time fractional-delay frequency response F_(μ)(ω) is obtained. We denote by F(Ω) the Fourier transform of the continuous-time filter f(t). Hence, the Fourier transform of f(t−μ) must be e^(−jΩ)μF(Ω). We know that f_(μ)(n)=f(n−μ) are just samples of f(t−μ), where −∞<t<∞. Therefore, according to the sampling theorem (Proakis, J. G., Digital Signal Processing, Macmillan, New York, N.Y. (1992)), the Fourier transform of f_(μ)(n) is $\begin{matrix} {{F_{\mu}(\omega)} = {\sum\limits_{k = {- \infty}}^{\infty}{{\mathbb{e}}^{{- {j{({\Omega - {2\pi\quad k}})}}}\mu}{F\left( {\Omega - {2\pi\quad k}} \right)}}}} & (4.5) \end{matrix}$ after we replace Ω on the right-hand-side expression by the normalized angular frequency variable ω(ω=Ω since T_(S)=1). This relationship is shown in FIG. 26, where F(Ω) corresponds to the N=8 interpolator of FIG. 11. As discussed in Section 3.2, f(t) is symmetric around t=0. This implies that F(Ω) has zero phase. To make the f(t) filter physically realizable, of course, we must introduce a delay of N/2, where N corresponds to the length of the filter. However, this delay simply “shifts” all input samples by N/2, which is an integer because N is even, and it does not change the characteristic of the input signal. Thus, it does not influence the interpolation accuracy. Therefore, to simplify our notation, we just use F(Ω) as a real function. Hence, the phase of the complex function e^(−jΩμ)F(Ω) is −Ωμ if F(Ω)≧0, or −Ωμ+π if F(Ω)<0—the phase depends on μ. FIG. 26 shows that the frequency response of the discrete-time filter F_(μ)(ω) is obtained by first making an infinite number of copies of e^(−jΩ)μF(Ω) by shifting this function uniformly in successive amounts of 2π, then by adding these shifted versions to e^(−jΩ)μF(Ω). As a sum of complex functions, the shape of F_(μ)(ω) depends not only on the shape of the continuous-time frequency response F(Ω) but also on the value μ. The dependence of F_(μ)(ω) on μ is illustrated in FIG. 27, where F_(μ)(ω) is obtained from the function F(Ω) in FIG. 26, using μ=0.12 and μ=0.5. The magnitude of the ideal fractional-delay frequency response, defined in (4.3), is shown in both FIG. 27A and FIG. 27B as the dashed lines. It is evident that the frequency response 2706 is worse for μ=0.5 than the frequency response 2704 is for μ=0.12, since the response 2706 deviates more from the ideal frequency response 2702 than does the frequency response 2704. Hence, the interpolation error is larger for μ=0.5 than for μ=0.12. We have observed in our simulations that the largest interpolation error occurs when μ=0.5, i.e., when the interpolated sample is exactly in the middle of the two nearest existing samples. As ii approaches 0 or 1 (i.e., as the interpolated sample gets closer to an existing sample), the interpolation error becomes smaller. Moreover, the interpolation errors obtained for μ and 1−μ are the same. 4.2 Resampler Optimizations

In Section 3, we analyzed the relationship between the weights {circumflex over (F)}(k) in (3.9) and the frequency response of the interpolator. We have shown that we can enhance F(Ω) by adjusting the {circumflex over (F)}(k) values. In FIG. 23 (N=8), for example, the {circumflex over (F)}(3) and {circumflex over (F)}(5) values correspond to the magnitude of the pulses 2302 near the band edge. If we adjust {circumflex over (F)}(3) and {circumflex over (F)}(5) such that the transition between the passband and stopband is more gradual, we can achieve a better frequency response.

To further improve the interpolation performance, we could take μ into account, by optimizing F_(μ)(ω) for each μ value. As in Section 3, we could adjust {circumflex over (F)}(k) near the band edge to change the shape of F(Ω), for each μ value, such that the discrete-time frequency response F_(μ)(ω), which is obtained from (4.5), best approximates the desired response of (4.3).

As discussed in Section 3, to guarantee that the original samples are not altered using the modified interpolator, the weights {circumflex over (F)}(k) should satisfy (3.18). When N=8, for example, we modify {circumflex over (F)}(3) and {circumflex over (F)}(5) together in order to satisfy (3.18). Here, however, our goal of optimization is to obtain the best approximation for the sample corresponding to a specific μ. Hence we need not be concerned with the issue of altering the original samples in Section 3, where there is only one set of optimized weights for all μ values.

Let us demonstrate this method using the example of N=8. We chose to modify {circumflex over (F)}(3) and {circumflex over (F)}(4). For each given μ, we search for the {circumflex over (F)}(3) and {circumflex over (F)}(4) values such that (4.4) is minimized. We denote such {circumflex over (F)}(3) and {circumflex over (F)}(4) values by {circumflex over (F)}_(μ)(3) and {circumflex over (F)}_(μ)(4) respectively, since they are now also dependent on μ. FIGS. 28A and B show the modifications to F(Ω) for μ=0.12 and μ=0.5, respectively. The corresponding optimized F_(μ)(ω) functions are illustrated in FIGS. 28C and 28D, respectively.

To demonstrate the performance improvement, let us use this example: Given μ=0.5, we optimize F_(μ)(ω) for the signal whose spectrum is shown in dashed lines 2902 in FIG. 29. Comparing the un-optimized frequency response 2904 with the optimized frequency response 2906, the modification clearly produces a better frequency response. More specifically, the response 2906 is flat in the frequency band where the power of the signal 2902 is concentrated, and the deviation from the ideal response mostly falls in the “don't care” band.

Similar to Section 3, to implement this improved method, we first compute the coefficients c_(k) from the existing samples as in (2.9). Then, given the μ value, we multiply, e.g., for N=8, the c₃ and c₄ values by {circumflex over (F)}_(μ)(3) and {circumflex over (F)}_(μ)(4), respectively. Finally, we compute the synchronized sample y(μ) using (2.11), where c₃ and c₄ are replaced by {circumflex over (F)}_(μ)(3) c₃ and {circumflex over (F)}_(μ)(4) c₄, respectively.

We can apply similar modifications to the interpolator with N=4. FIG. 30A show the frequency response of the interpolator 1000, for μ=0.5, while FIG. 30B displays the results of a modified interpolator 1000, where parameters {circumflex over (F)}(1) and {circumflex over (F)}(2) are optimized, for μ=0.5, to maximize the interpolation accuracy for the signal whose spectrum is shown in dashed lines. As can be seen the optimized response 3006 is flatter in the part of the spectrum of the signal 3002 where most of its energy is concentrated than is the un-optimized response 3004.

The flowchart 3400 in FIG. 34 generalizes the optimization of the trigonometric optimization procedure. The flowchart 3400 is similar to the flowchart 1700, but includes the additional steps of 3402 and 3404 that are described as follows.

In step 3402, a factors {circumflex over (F)}_(μ) is determined to adjust the frequency response of the trigonometric interpolator so that it is consistent with the frequency response of N-data samples and the offset μ.

In step 3404, one or more of the complex coefficients are multiplied by the {circumflex over (F)}_(μ) to modify the frequency response of the interpolator so that it is consistent with the input signal and the offset μ.

The optimization routine can also be used with K-modified data samples that leads to the simplified interpolator structures of FIGS. 14 and 15. The flowchart 3500 illustrates the {circumflex over (F)}_(μ) factor modification in the context of the flowchart 1900.

As will be shown in the section that follows, the steps 3402, 3404, and 1708 can be combined into a single step if a table lookup is used to determine the rotation factor. In other words, the sine and cosine values can be multiplied by the {circumflex over (F)}_(μ) factor before they are stored in the ROM.

In Section 2.6, we have presented an efficient algorithm that eliminates one angle-rotation. For example, for N=4, we can “modify” the input samples according to (2.22). With this modification, we can treat the new samples as if the input signal satisfies c₂=0. The remaining non-zero coefficients are c₀ and c₁. In the example for N=4 in the previous Section, two parameters, {circumflex over (F)}_(μ)(1) and F(2), are optimized to achieve the best approximation of a desired fractional-delay frequency response described by (4.3). Now, with c₂=0, we have only one parameter, {circumflex over (F)}_(μ()1), to choose.

The impulse response of the simplified interpolation filter is derived in Appendix B. From the mathematical expression of the impulse response (B.5), we can obtain the corresponding frequency response. The frequency responses of the interpolator 1400 (FIG. 14) before and after applying the modification are shown in FIG. 31A-B, respectively. We can see an improved frequency response 3106 over the response 3104, as the response 3106 is flatter in the part of the signal 3102 where its energy is concentrated. Furthermore, it seems that the frequency response 3106, where only c₁ is modified (c₂=0!), is as good as the modified response 3006 in FIG. 30B where both c₁ and c₂ are modified.

4.3 Implementations

It may appear that additional hardware is needed to implement the multiplication by, for example, {circumflex over (F)}_(μ)(1) for the simplified N=4 structure. Let us examine the corresponding computations. As we know, we first compute coefficients c₀ and c₁ according to (2.25) (c₂=0, of course). We then compute y(μ) using $\begin{matrix} {{y(\mu)} = {{\frac{1}{4}\left( c_{0} \right)} + {\frac{1}{2}{{Re}\left( {{{\hat{F}}_{\mu}(1)}c_{1}{\mathbb{e}}^{j\quad\frac{\pi}{2}\mu}} \right)}} - {K\quad\mu}}} & (4.6) \end{matrix}$ according to (2.26) and (2.27), where K is defined in (2.24). As discussed in Section 2.4, the computation $\begin{matrix} {{{Re}\left( {{{\hat{F}}_{\mu}(1)}c_{1}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)} = {{{Re}\left( c_{1} \right)}\left( {{{Re}\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}}} \right)} - {{{Im}\left( c_{1} \right)}{{Im}\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)}}} \right.}} & (4.7) \end{matrix}$ can be accomplished by retrieving the ${{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}$ value from a ROM lookup table and then multiplying Re(c₁)+j Im(c₁) by the retrieved value, since both ${{\hat{F}}_{\mu}(1)}\quad{and}\quad{\mathbb{e}}^{j\frac{\pi}{2}\mu}$ can be pre-determined for all μ values.

If the angle-rotation method is used, we can use a lookup table to store the {circumflex over (F)}_(μ)(1) values. In real-time, after computing $c_{1}{\mathbb{e}}^{j\frac{\pi}{2}\mu}$ using an angle-rotation processor, we can multiply the result by {circumflex over (F)}_(μ)(1). In this case, if {circumflex over (F)}_(μ)(1) is allowed to be a complex number in optimizing performance, we then need two real multiplications to obtain ${Re}\left( {{{\hat{F}}_{\mu}(1)}c_{1}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)$ in (4.6). However, if we restrict {circumflex over (F)}_(μ)(1) to be a real number, we can use just one real multiplication as $\begin{matrix} {{{Re}\left( {{{\hat{F}}_{\mu}(1)}c_{1}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)} = {{{\hat{F}}_{\mu}(1)}{{Re}\left( {c_{1}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)}}} & (4.8) \end{matrix}$

According to Table 4.1, the NMSE using complex and real {circumflex over (F)}_(μ()1) values are −37.41 dB and −37.08 dB, respectively. Therefore, the performance degradation caused by restricting {circumflex over (F)}_(μ)(1) to be a real number is insignificant.

When the table-lookup method is employed, the implementation structure for the optimal interpolator is the same as that for the interpolator 1400, except for the coefficient c₁ which is now multiplied by ${{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}\quad{instead}\quad{of}\quad{{\mathbb{e}}^{j\frac{\pi}{2}\mu}.}$ . The table should therefore contain the ${Re}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)\quad{and}\quad{Im}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)$ values, rather than the $\sin\frac{\pi}{2}\mu\quad{and}\quad\cos\frac{\pi}{2}\mu$ values used by the interpolator 1400. We now show that the size of the table is the same as the one storing the sine and cosine values.

Let us examine the contents of the lookup table. FIG. 32 displays the ${Re}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)\quad{and}\quad{Im}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)$ values, used by (4.7), where the real values are represented by curve 3202, and the imaginary values are represented by the curve 3204. These values are monotonic with respect to μ, just like the $\sin\frac{\pi}{2}\mu\quad{and}\quad\cos\frac{\pi}{2}\mu$ values for 0≦μ≦1. Moreover, simulations show that, when optimal values of {circumflex over (F)}_(μ()1) are reached, the real and imaginary components of ${{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}$ display the following complementary relationship: $\begin{matrix} {{{Im}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)} = {{Re}\quad{\left( {{{\hat{F}}_{1 - \mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}{({1 - \mu})}}} \right).}}} & (4.9) \end{matrix}$ Therefore, we need only store one of the ${Re}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)\quad{and}\quad{Im}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)$ values. The other can be obtained by looking-up the value corresponding to 1-μ. This is the same technique used in storing and retrieving the sine and cosine values with the purpose of reducing the table size.

Various circuit implementations of optimized interpolators having N=4 are illustrated in FIGS. 36-37. These circuit implementations are presented for example purposes only and are not meant to be limiting, as those skilled in the arts will recognize other circuit implementation based on the discussion given herein, including interpolator configurations having different N values.

FIG. 36 illustrates an optimized interpolator 3600 that is based on the simplified interpolator 1400 (FIG. 14). The interpolator 3600 includes an {circumflex over (F)}_(μ) ROM 3602 and a multiplier 3604. The ROM 3600 stores the appropriate {circumflex over (F)}_(μ) value indexed by μ. The multiplier 3604 multiples the complex coefficient C₁ by the appropriate {circumflex over (F)}_(μ) value, and therefore optimizes the frequency response of the interpolator 3600. As discussed above, the order of the angle rotator 1010 b and the multiplier 3604 can be interchanged so that the rotated complex coefficient is modified by the {circumflex over (F)}_(μ) value.

FIG. 37 illustrates an optimized interpolator 3700 that is similar to the optimized interpolator 3600, except that the {circumflex over (F)}_(μ) ROM 3602, the multiplier 3604, and the angle rotator 1010 b are combined into to a single ROM 3702, that stores the ${Re}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)\quad{and}\quad{Im}\quad\left( {{{\hat{F}}_{\mu}(1)}{\mathbb{e}}^{j\frac{\pi}{2}\mu}} \right)$ values. Therefore, coefficient optimization and angle rotation are performed in a simultaneous and efficient manner.

It will be apparent to those skilled in the arts that the combined {circumflex over (F)}_(μ) and angle rotator ROM 3702 can be implemented for interpolator configurations that include more than N=4 elements, based on the discussions herein.

4.4 Simulation Results

We have verified the new design with the following simulation. A baseband signal, shown in FIG. 33, with raised cosine spectrum, two samples per symbol and 40% excess bandwidth was generated. Table 4.1 compares the result for N=4 using four interpolation structures: 1) the Lagrange cubic interpolator, 2) the interpolator 1000, 3) the interpolator 1400, 4) the optimal resampler using a complex {circumflex over (F)}_(μ()1) value, and 5) the optimal resampler employing a real {circumflex over (F)}_(μ)(1) value.

Using the optimal structure, the NMSE is reduced by 4 dB over the method without optimization (FIG. 14 structure). The performance is improved by more than 6 dB compared to the Lagrange cubic interpolator, while the hardware is reduced. Comparing the optimal structure to the FIG. 14 structure, a 4 dB performance gain was obtained without increasing the amount of hardware. TABLE 4.1 Comparison of interpolators for N = 4. Lagr. Optimal Optimal cubic Struct. in Struct. in table- angle- N = 4 struct. lookup^(a) rotat.^(b) NMSE in dB −31.08 −31.21 −33.51 −37.41 −37.08 Scaling multipliers 2 0 0 0 0 Data multipliers 3 3 3 3 4 Multipliers in 4 2 2 2 3 critical path $\quad^{a}{Complex}\quad{{\hat{F}}_{\mu}(1)}\quad{values}\quad{are}\quad{{used}.\quad{The}}\quad{table}\quad{stores}\quad{the}\quad{{\hat{F}}_{\mu}(1)}e^{j\frac{\pi}{2}\mu}$ $\quad^{b}{Real}\quad{{\hat{F}}_{\mu}(1)}\quad{values}\quad{are}\quad{{used}.\quad{The}}\quad{output}\quad{of}\quad{the}\quad{angle}\text{-}{rotator}\quad{{Re}\left( {c_{1}e^{j\frac{\pi}{2}\mu}} \right)}$ is multiplied by {circumflex over (F)}_(μ)(1). Thus, one more real multiplexer is needed.

The frequency response of an optimized interpolator 1400 (FIG. 14) using a lookup table is shown in FIG. 16D. Also shown in FIG. 16A-D are the frequency responses of the Lagrange cubic interpolator 400, the interpolator 1000, and the interpolator 1400 without optimization. The signal spectrum of FIG. 33 is shown in FIG. 16D in dashed lines 1604. The interpolation error corresponds to the gray area 1606. From FIG. 16D, the performance improvement achieved by the optimal interpolator is evident because the gray area 1606 d is a lower amplitude than the corresponding gray areas 1606 a-c. In addition, these improvements are accomplished without increasing the amount of hardware.

For a high-performance interpolator, we now turn to the structure described in Section 2.6.2, for N=8. Applying a similar approach for N=4, as just discussed, to the N=8 interpolator of Section 2.6.2, we can multiply the c₃ coefficient by {circumflex over (F)}_(μ()3), whose value optimizes the frequency response F_(μ)(ω) of a fractional-delay filter with delay μ.

In designing the proposed N=8 interpolator, only one parameter {circumflex over (F)}_(μ)(3) was adjusted to minimize the MSE in (3.22).

Next, three interpolators of length N=8 were used to interpolate the signal in FIG. 33: 1) a Lagrange polynomial interpolator, 2) a Vesma-Saramäki optimal polynomial interpolator (Vesma, J., and Saramäki, T., “Interpolation filters with arbitrary frequency response for all-digital receivers,” in Proc. 1996 IEEE Int. Symp. Circuits Syst. (May 1996), pp. 568-571) (with length 8 but a third degree polynomial) and, 3) the proposed interpolator.

Table 4.2 shows the simulation results. These results demonstrate that our method has an NMSE more than 16 dB lower than the Lagrange interpolator, and more than 4 dB lower than the Vesma-Saramäki polynomial interpolator in (Vesma, J., and Saramäki, T., “Interpolation filters with arbitrary frequency response for all-digital receivers,” in Proc. 1996 IEEE Int. Symp. Circuits Syst. (May 1996), pp. 568-571). TABLE 4.2 Performance comparison. Lagrange Vesma-Saramäki Proposed N = 8 interpolator interpolator interpolator NMSE in dB −45.29 −57.34 −62.17 Scaling multipliers 25 16 2 Multipliers 7 3 7 4.5 Conclusion

Instead of optimizing F(Ω), the frequency response of the continuous-time interpolation filter, we could optimize F_(μ)(ω) of the fractional-delay filter for each 1 value. By doing this, better interpolation performance can be achieved, as demonstrated by the simulations.

As for the implementation complexity, when a table-lookup method is employed, the optimal interpolator does not require additional hardware, just table values that implement the coefficient optimization and angle rotation. When the angle rotation method is used, one additional real multiplier is needed.

For N=4, the optimal interpolator attained a 6 dB lower NMSE than the Lagrange cubic interpolator, while requiring less hardware.

5. A HIGH-SPEED ANGLE ROTATION PROCESSOR

In previous Sections, an interpolation method and apparatus for timing recovery using a trigonometric polynomial has been discussed. The major computation in this method is the angle rotation, such as angle rotator 1010 (in FIG. 10 and FIG. 14). As mentioned in Section 2.4, these operations, together with the phase rotator for carrier recovery, can be implemented by table-lookup in a ROM containing pre-computed sine and cosine values, followed by four real multipliers to perform the angle rotation (see FIG. 18). Herein, going forward, this approach will be referred to as the single-stage angle rotation. Although fast angle rotation can be achieved with efficient multiplier design techniques, for practical precision requirements, the ROM table can be quite large. For applications where low complexity and low power are the major concern, can we further reduce the amount of hardware for angle rotation with slightly more computational delay?

There are various hardware designs that accomplish angle rotations, notably the CORDIC processors (Ahn, Y., et al., “VLSI design of a CORDIC-based derotator,” in Proc. 1998 IEEE Int. Symp. Circuits Syst., Vol. II (May 1998), pp. 449-452; Wang, S., et al., “Hybrid CORDIC algorithms,” IEEE Trans. Comp. 46:1202-1207 (1997)), and, recently, an angle-rotation processor (Madisetti, A., et al., “A 100-MHz, 16-b, direct digital frequency synthesizer with a 100-dBc spurious-free dynamic range,” IEEE J. Solid-State Circuits 34:1034-1043 (1999)). These algorithms accomplish the rotation through a sequence of subrotations, with the input to each subrotation stage depending on the output of the previous stage. In these cases, the latency is proportional to the precision of the angle.

We now propose a different approach for angle rotation. Here the rotation is partitioned into just two cascaded rotation stages: a coarse rotation and a fine rotation. The two specific amounts of rotation are obtained directly from the original angle without performing iterations as does CORDIC. The critical path is therefore made significantly shorter than that of the CORDIC-type methods. In addition, only a small lookup table is needed.

In this Section, methods and apparatus for two-stage angle rotation will be described. These method and apparatus are meant for example purposes only, and are not meant to be limiting. Those skilled in the arts will recognize other methods and apparatus for two stage angle rotation based on the discussion given herein. These other methods and apparatus for angle rotation are within the scope and spirit of the present invention.

It will be shown that more precision and less hardware can be obtained using the two stage angle rotator compared to the single-stage angle rotator, with slightly more computational delay. We will then show that, given an overall output precision requirement, various simplifications can be applied to the computations within the two stages to reduce the total hardware.

5.1 The Angle Rotation Problem

If we rotate a point in the X-Y plane having coordinates (X₀, Y₀) counterclockwise, around the origin, by the angle φ, a new point having coordinates (X, Y) is obtained. It is related to the original point (X₀, Y₀) as: X=X ₀ cos φ−Y ₀ sin φ Y=Y ₀ cos φ+X ₀ sin φ  (5.1)

5.1.1 Single-Stage Angle Rotation

The operation in (5.1) is found in many communication applications, notably in digital mixers which translate a baseband signal to some intermediate frequency and vice versa. In addition to accomplishing (5.1) with CORDIC, a very common implementation is to store pre-computed sine/cosine values in a ROM (Tan, L. and Samueli, H., “A 200-MHz quadrature frequency synthesizer/mixer in 0.8-μm CMOS,” IEEE J. Solid-State Circuits 30:193-200 (1995)). Then, in real-time, the computation in (5.1) is accomplished with a ROM access for each given (p followed by four real multiplications. This method avoids the excessive latency of the iterations performed by CORDIC and can yield lower latency than the angle-rotation method (Madisetti, A., “VLSI architectures and IC implementations for bandwidth efficient communications,” Ph.D. dissertation, University of California, Los Angeles (1996)). Furthermore, a very fast circuit can be built, based on efficient multiplier design techniques. However, since the size of the ROM grows exponentially with the precision of φ, a rather large ROM is required to achieve accurate results.

ROM compression can be achieved by exploiting the quarter-wave symmetry of the sine/cosine functions and such trigonometric identities as sin θ=cos(π/2−θ). The angle φ in the full range [0,2π] can be mapped into an angle θε[0,π/4]. This is accomplished by conditionally interchanging the input values and X₀ and Y₀, and conditionally interchanging and negating the output X and Y values (Madisetti, A., “VLSI architectures and IC implementations for bandwidth efficient communications,” Ph.D. dissertation, University of California, Los Angeles (1996)). Thus, we will focus only on θε[0,π/4] and replace φ by θ in (5.1). Defining θ=(π/4) θ, we must have θε[0,1].

Obviously, the sine/cosine ROM samples must be quantized because of the limited storage space for sine/cosine samples. This produces an error in the ROM output when compared to the true (unquantized) sine/cosine value, which will subsequently be referred to as the ROM quantization error. Next we examine how this error affects the output. Let cos θ and sin θ be quantized to N bits, to become [cos θ] and [sin θ], respectively. We have cos θ=[cos θ]+Δ_(cos θ) sin θ=[sin θ]+Δ_(sin θ)  (5.2) where Δ_(cos θ) and Δ_(sin θ) are the ROM quantization errors, which satisfy |Δcos θ|<2^(−N) and |Δ_(sin θ)|<2^(−N). The error in X due to the ROM quantization is the difference between X calculated using infinite-precision sine/cosine values and the quantized values, that is $\begin{matrix} \begin{matrix} {\Delta_{X} = {\left( {{X_{0}\cos\quad\theta} - {Y_{0}\sin\quad\theta}} \right) - \left( {{X_{0}\left\lbrack {\cos\quad\theta} \right\rbrack} - {Y_{0}\left\lbrack {\sin\quad\theta} \right\rbrack}} \right)}} \\ {= {{X_{0}\Delta_{\cos\quad\theta}} - {Y_{0}{{\Delta\quad}_{\sin\quad\theta}.}}}} \end{matrix} & (5.3) \end{matrix}$ Its upper bound is |Δ_(x)<1<(|X ₀ |+|Y ₀|)2^(−N).  (5.4)

5.1.2 Rotation by a Small Angle

If the rotation angle happens to be so small that |θ|<2^(−N/3)  (5.5) then its sine/cosine values can be approximated as sin θ≈θ  (5.6) cos θ≈1−(θ²/2).  (5.7) For such θ no table is needed. Next, we show how accurate (5.6) and (5.7) are by estimating their approximation errors.

The Taylor expansion of sin θ near θ=0 yields $\begin{matrix} {{\sin\quad\theta} = {\theta - {\frac{\sin^{\prime}\xi}{6}\theta^{3}}}} & (5.8) \end{matrix}$ where ξ=hθ≦h≦1. Thus, since |sin′ξ|=|cos ξ|≦1  (5.9) and in view of (5.5), an error bound on (5.6) is |Δ_(sin θ)|=|sin θ−θ|≦|θ³/6|<2^(−N)/6.  (5.10) Similarly, the Taylor expansion of cos θ yields $\begin{matrix} {{\cos\quad\theta} = {1 - {\frac{1}{2}\theta^{2}} + {\frac{\cos\quad\xi}{24}{\theta^{4}.}}}} & (5.11) \end{matrix}$ Thus, an error bound on (5.7) is |Δ_(cos θ)|=|cos θ−(1−θ²/2)|≦|θ⁴/24|  (5.12) which is negligible in comparison to the bound on |Δ_(sin θ)|.

5.1.3 Partitioning into Coarse and Fine Rotations

While it is unlikely that (5.5) is satisfied for a given θε[0,π/4], i.e., θε[0,1] if we let B>N/3 be the number of bits in θ, then we can express θ= θ _(M)+ θ _(L) where θ _(M) =d ₁2⁻¹ + . . . +d _(N/3)2^(N/3)  (5.13) θ _(L) =d _(N/3+1)2^(−N/3−1) + . . . d _(B)2^(−B)  (5.14) with d_(i)ε{0,1}. Next we define θ_(M)=(ζ/4) θ _(M) and θ_(L)=(π/4) θ _(L). Clearly, with π/4<1 and from (5.14), θ_(L) satisfies (5.5).

If we substitute θ=θ_(M)+θ_(L) for φ in (5.1) and expand cos(θ_(M)+θ_(L)) and sin(θ_(M)+θ_(L)), we obtain: X═X ₁ cos θ_(L)−Y₁ sin θ_(L) Y═Y₁ cos θL+X₁ sin θ_(L)  (5.15) and X ₁ =X ₀ cos θ_(M)−Y₀ sin θ_(M) Y ₁=Y₀ cos θ_(M)+X₀ sin θ_(M).  (5.16)

Now the rotation (5.1) is decomposed into two stages: a coarse rotation (5.16) by θ_(M) followed by a fine rotation (5.15) by θ_(L). With this partitioning (5.5) and (5.6) can be applied to the fine stage: X═X ₁(1−θ_(L) ²/2)−Y₁θ_(L) Y═Y ₁(1−θ_(L) ²/2)+X ₁ θ _(L).  (5.17)

A benefit of this partitioning is that the functions cos θ_(M) and sin θ_(M) in (5.16) depend only on the N/3 most significant bits of the angle θ, where θ=(π/4) θ. They can be stored in a small lookup table. This results in a significant ROM size reduction. However, the approximation (5.6) introduces additional error. We now seek to achieve an overall precision comparable to that in the implementation having one stage and a large ROM table.

Defining the approximation errors Δ_(sin θ) _(L) =sin θ_(L)−θ_(L) and Δ_(cos θ) _(L) =cos θ_(L)−(1−θ_(L) ²/2) and neglecting terms that are products of error terms or products of an error term and sin θ_(L), which is always small, we calculate the total error in X as the difference between X calculated using (5.15) and (5.16) and X calculated using quantized sin θ_(M) and cos θ_(M), and in (5.16) and using (5.17) instead of (5.15). We obtain: Δ_(X) =X ₀(Δ_(cos θ) _(M) cos θ_(L)+Δ_(cos θ) _(L) cos θ_(M)−Δ_(sin θ) _(L) sin θ_(M)) −Y ₀(Δ_(sin θ) _(M) cos θ_(L)+Δ_(cos θ) _(L) sin θ_(M)−Δ_(sin θ) _(L) cos θ_(M)).  (5.18)

Comparing this error estimate with (5.3) and (5.4) it is evident that, so long as the errors due to Δ_(cos θ) _(L) and Δ_(sin θ) _(L) are sufficiently small, the error Δ_(X) in (5.18) can be made comparable to that of (5.4) by reducing the Δ_(cos θ) _(M) and Δ_(sin θ) _(M) values, i.e., by increasing the number of bits in the sine/cosine samples stored in the ROM. For example, if we add one more bit to the sine/cosine samples, then |Δ_(cos θ) _(M) |<2^(−N−1) and |Δ_(sin θ) _(M) |<2^(−N−1) Therefore, from (5.18), we have $\begin{matrix} {{{\Delta_{X}} < {{{X_{0}}\left( {2^{{- N} - 1} + {2^{{- 4}\quad{N/3}}/24} + {2^{- N}/6}} \right)} + {{Y_{0}}\left( {2^{{- N} - 1} + {2^{{- 4}\quad{N/3}}/24} + {2^{- N}/6}} \right)}}} = {\left( {{X_{0}} + {Y_{0}}} \right)2^{- N}\left( {{1/2} + {1/6} + {\left( {1/24} \right)2^{{- N}/3}}} \right)}} & (5.19) \end{matrix}$ which is smaller than (5.4). A similar relationship can be found for Δ_(Y). This demonstrates that, if we add one more bit of precision to the ROM for the coarse stage, we can achieve the same precision as that in the one-stage case, but with a significantly smaller ROM.

A straightforward implementation of this method is illustrated by the angle rotator 3800 in FIG. 38. The angle rotator 3800 includes a ROM 3802, butterfly circuits 3806 and 3810, and fine adjustment circuit 3804.

The ROM 3802 stores the cos θ_(M) and sin θ_(M) values, where θ_(M) is the most significant part of the input angle θ. In embodiments the input angle θ is normalized and represented by a binary number, so that θ_(M) is the most significant word of the binary number, and θ_(L) is the least significant word of the binary number.

The first butterfly circuit 3806 multiplies the input complex number 3812 by the (cos θ_(M))⁺ and the (sin θ_(M))⁺ to perform a coarse rotation, where the ( )⁺ denotes that the appropriate ROM quantization errors have been added to the cos θ_(M) and sin θ_(M), by the adders 3814.

The fine adjustment circuit 3804 generates a fine adjust value (1−θ_(L) ²), where θ_(L) is the least significant word of the input angle θ.

The second butterfly circuit 3810 multiples the output of circuit 3806 by θ_(L) ⁺ and the fine adjustment value from circuit 3804, to perform a fine rotation that results in the rotated complex number 3814. The ⁺ on the θ_(L) ⁺ denotes that an error value Δ_(sin θ) _(L) in has been added to improve the accuracy of the fine rotation.

The three error sources Δ_(cos θ) _(M) , Δ_(sin θ) _(M) and Δ_(sin θ) _(L) are shown. The much smaller error source Δ_(cos θ) _(L) has been neglected. The thick line depicts the path along which the ROM quantization error Δ_(cos θ) _(M) propagates to X. The error Δ_(cos θ) _(M) is multiplied by X₀ and then by cos θ_(L) as it propagates along this path to become Δ_(cos θ) _(M) X₀ cos θ_(L) when it reaches the output. This matches the error term in (5.18) obtained from our calculation. In subsequent discussions we will use this graphical approach to find the error at the output due to various error sources.

The ROM table 3802 in the rotator 3800 contains many fewer sine/cosine samples in comparison to the number of samples needed to implement (5.1) using a conventional (single stage) table-lookup approach. Although the approximation (5.6) introduces additional error, so long as that error is smaller than the conventional ROM quantization error, we can increase the precision of the samples in our small ROM table such that, overall, precision is not sacrificed. In principle, we can reduce the hardware complexity significantly in one block of our structure, with the corresponding accuracy loss compensated by higher precision from another block, and at the cost of a slight increase in the complexity of that block. As a result, the complexity of the overall structure is reduced without loss of accuracy. We will now exploit this idea again to further reduce the computational complexity.

5.2 Simplification of the Coarse Stage

The coarse stage, according to (5.16), involves multiplications of input data X₀ and Y₀ by the cos θ_(M) and sin θM values. Writing sin θ_(M) as the binary number sin θ_(M)=0.b ₁ . . . b _(N/3) b _(N/3+1)  (5.20) where b_(n)ε{0,1}, we now round sin θ_(M) upward, to obtain an (N/3+1)-bit value [sin θ_(M)], as [sin θ_(M)]=0.b ₁ . . . b _(N/3) b _(N/3+1)+2^(−(N/3+1)),  (5.21) where N represents the number of bits in the real part and the imaginary part of the input complex number. In other words, the real part has N bits, and the imaginary part has N bits. Letting θ₁ be the angle for which sin θ₁=[sin θ_(M)]  (5.22) we must have θ₁≧θ_(M). Next we can compute the corresponding cos θ₁ value. Using sin θ₁=[sin θ_(M)] and cos θ₁ values, we actually rotate the point having coordinate (X₀, Y₀) by θ₁, instead of θ_(M), as X ₁ =X ₀ cos θ₁ −Y ₀ sin θ₁ Y ₁ =Y ₀ cos θ₁ +X ₀ sin θ₁.  (5.23) Since θ₁=arcsin([sin θ_(M)]) and, of course, θ_(M)=arcsin(sin θ_(M)), applying the mean value theorem we have $\begin{matrix} {\frac{\theta_{1} - \theta_{M}}{\left\lbrack {\sin\quad\theta_{M}} \right\rbrack - {\sin\quad\theta_{M}}} = {{a\quad\sin^{\prime}\xi} = \frac{1}{\sqrt{1 - \xi^{2}}}}} & (5.24) \end{matrix}$ where ξ satisfies sin θ_(M)≦ξ≦[sin θ_(M)]. Since sin θ_(M)≦1/(√{square root over (2)}), according to (5.21) we must have $\begin{matrix} {\xi \leq \left\lbrack {\sin\quad\theta_{M}} \right\rbrack \leq {{\sin\quad\theta_{M}} + 2^{- {({{N/3} + 1})}}} \leq {\frac{1}{\sqrt{2}} + {2^{- {({{N/3} + 1})}}.}}} & (5.25) \end{matrix}$ For most applications, N≧9. Thus, according to (5.25), we have ξ≦0.7696. Applying this value to (5.24), $\begin{matrix} {{\theta_{1} - \theta_{M}} \leq {\frac{1}{\sqrt{1 - 0.7696^{2}}} \times \left( {\left\lbrack {\sin\quad\theta_{M}} \right\rbrack - {\sin\quad\theta_{M}}} \right)} \leq {1.566 \times {2^{- {({{n/3} + 1})}}.}}} & (5.26) \end{matrix}$ Because 0≦θ_(M)≦π/4, we have, for N≧12, that 0≦θ₁≦0.0978+π/4=0.8832.  (5.27)

The resulting fine-stage angle is θ-θ₁, instead of θ_(L)=θ−θ_(M). Thus, as in (Madisetti, A., “VLSI architectures and IC implementations for bandwidth efficient communications,” Ph.D. dissertation, University of California, Los Angeles (1996)), a modified fine-stage angle compensates for a simplified coarse-stage angle. Since sin θ₁=[sin θ_(M)], by rotating by θ₁, the (N/3+1)-bit number sin θ₁ decreases the number of partial products needed in computing X₀ sin θ₁ and Y₀ sin θ₁ to just over a third of those needed for X₀ sin θ_(M) and Y₀ sin θ_(M) This simplifies the computation in (5.23). However, if we can also reduce the multiplier size in computing X₀ cos θ₁ and Y₀ cos θ₁, we can further simplify (5.23). Certainly, truncating the cos θ₁ value would reduce the number of partial products in computing X₀ cos θ₁ and Y₀ cos θ₁. Let us truncate cos θ₁ to 2N/3 bits to obtain [cos θ₁]. Then, 0≦Δ_(cos θ) ₁ =[cos θ₁]<2^(−2N/3)  (5.28) We now have X ₁ =X ₀[cos θ₁]−Y₀ sin θ₁ Y ₁ =Y ₀[cos θ₁ ]+X ₀ sin θ₁.  (5.29) Apparently, by truncating cos θ₁, smaller multipliers are needed. But the amount of rotation is no longer θ₁. We now examine the effect on θ₁ of using the truncated value [cos θ₁] instead of cos θ₁ as $\begin{matrix} {\theta_{m} = {a\quad\tan\quad{\frac{\sin\quad\theta_{1}}{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack}.}}} & (5.30) \end{matrix}$ First, we determine how θ_(m) is different from θ₁ due to the truncation of cos θ₁. Letting cos θ₁ and [cos θ₁] denote specific values of a variable z we consider the function $\begin{matrix} {{\Theta(z)} = {a\quad\tan\quad{\frac{\sin\quad\theta_{1}}{z}.}}} & (5.31) \end{matrix}$

Hence, θ₁ and θ_(m) are the Θ(z) values corresponding to z₁=cos θ₁ and z₂=[cos θ₁], i.e., θ₁=Θ(z₁) and θ_(m)=Θ(z₂). According to the mean value theorem, we have $\begin{matrix} {{\frac{{\Theta\left( z_{1} \right)} - {\Theta\left( z_{2} \right)}}{z_{1} - z_{2}} = {\Theta^{\prime}(\xi)}}{or}} & (5.32) \\ {\frac{\theta_{1} - \theta_{m}}{{\cos\quad\theta_{1}} - \left\lbrack {\cos\quad\theta_{1}} \right\rbrack} = {a\quad\tan^{\prime}\frac{\sin\quad\theta_{1}}{\xi}}} & (5.33) \end{matrix}$ where [cos θ₁]≦ξ≦cos θ₁. The negation of the derivative ${atan}^{\prime}\frac{A}{\xi}$ satisfies $\begin{matrix} \begin{matrix} {{{- a}\quad\tan^{\prime}\frac{\sin\quad\theta_{1}}{\xi}} = {- \frac{\frac{\sin\quad\theta_{1}}{\xi^{2}}}{1 + \left( \frac{\sin\quad\theta_{1}}{\xi} \right)^{2}}}} \\ {= {\frac{\sin\quad\theta_{1}}{\left( {\sin\quad\theta_{1}} \right)^{2} + \xi^{2}} \leq {\frac{\sin\quad\theta_{1}}{\left( {\sin\quad\theta_{1}} \right)^{2} + \left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2}}.}}} \end{matrix} & (5.34) \end{matrix}$ According to (5.27), for N≧9 we have 0≦sin θ₁≦0.7727 0.6347≦cos θ₁≦1 0.6406<[cos θ₁]≦1.  (5.35) Since [cos θ₁]=cos θ₁−Δ_(cos θ1) from (5.28) we also have $\begin{matrix} \begin{matrix} {{\left( {\sin\quad\theta_{1}} \right)^{2} + \left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2}} = {\left( {\sin\quad\theta_{1}} \right)^{2} + \left( {{\cos\quad\theta_{1}} - \Delta_{\cos\quad\theta_{1}}} \right)^{2}}} \\ {= {{1 - {2\quad\cos\quad\theta_{1}\Delta_{\cos\quad\theta_{1}}} + \Delta_{\cos\quad\theta_{1}}^{2}} > {1 - 2^{{{- 2}{N/3}} + 1}}}} \end{matrix} & (5.36) \end{matrix}$

Combining (5.35) and (5.36), one can verify, for N≧9, that (5.34) satisfies $\begin{matrix} {{{- {atan}^{\prime}}\frac{\sin\quad\theta_{1}}{\xi}} < {0.7976.}} & (5.37) \end{matrix}$ Thus, according to (5.28) and (5.33), we have θ_(m)−θ₁<(cos θ₁−[cos θ₁ ]×)0.7976≦0.7976×2 ^(−2N/3).  (5.38) Combining (5.26) and (5.38), and for N≧9, we have 0≦θ_(m)−θ_(M)≦1.566×2^(−(N/3+1))+0.7976×2^(−2N/3)<0.8827×2^(−N/3).  (539) This is the amount of coarse rotation error, due to coarse-stage simplifications, that a modified fine stage must compensate. Let us examine the bound on the fine-stage angle.

Now, the fine rotation angle is θ_(l)=θ−θ_(m) instead of θ_(L). If θ_(l) satisfies |θ_(l)|<2^(−N/3)  (5.40) then we have |sin θ_(l)−θ_(l)|<2^(−N)/6. That is, the approximations sin θ_(l)≈θ_(l) and cos θ_(l)≈1−θ_(l) ²/2 can be applied as discussed in Section 5.1. Let us now examine the bound on θ₁. By definition, $\begin{matrix} {{0 \leq \theta_{L}} = {{\frac{\pi}{4}\overset{\_}{\theta_{L}}} < {0.7854 \times {2^{{- N}/3}.}}}} & (5.41) \end{matrix}$ Therefore, subtracting (5.39) from (5.41) yields −0.8827×2^(−N/3)<θ_(L)−(θ_(m)−θ_(M))<0.7854×2^(−N/3)  (5.42) which implies (5.40) because θ_(l)=θ−θ_(m)=θ_(M)+θ_(L)−θ_(m)=θ_(L)−(θ_(m)−θ_(M)).  (5.43) Hence, no lookup table is needed for the fine stage.

Next, we examine the magnitude of the complex input sample after rotation. One can verify from (5.29) that X ₁ ² +Y ₁ ²=(X ₀ ² +Y ₀ ²)([cos θ₁]²+(sin θ₁)²).  (5.44) Since [cos θ₁] is obtained by truncating cos θ₁, we must have 0≦[cos θ₁]≦cos θ₁, thus [cos θ₁]²+(sin θ₁)²≦(cos θ₁)²+(sin θ₁)²=1.  (5.45) Therefore, X ₁ ² +Y ₁ ² ≦X ₀ ² +Y ₀ ².  (5.46) To maintain the magnitude, the result X₁ and Y₁ must then be multiplied by 1/√{square root over ([cos θ₁]²+(sin θ₁)²)}. We define a new variable δ_([cos θ) _(]) such that $\begin{matrix} {\frac{1}{\sqrt{\left\lbrack {{cso}\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}} = {1 + {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack}.}}} & (5.47) \end{matrix}$ Since √{square root over ((cos θ₁)²+(sin θ₁)²)}=1, and [cos θ₁] is very close to cos θ₁ because of (5.28), we have that √{square root over ([cos θ₁]²+(sin θ₁)²)} is very close to 1. Thus, the δ_([cos θ) ₁ _(]) value must be very small. We now examine the bound on δ_([cos θ) ₁ _(]). We can write 1/√{square root over ([cos θ₁]₂+(sin θ₁)²)} as $\begin{matrix} {\frac{1}{\sqrt{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}} = {\sqrt{\frac{\left( {\cos\quad\theta_{1}} \right)^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}}.}} & (5.48) \end{matrix}$ Substituting (5.28) into (5.48), we have $\begin{matrix} {\frac{1}{\sqrt{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}} = {\sqrt{1 + \frac{{{2\left\lbrack {\cos\quad\theta_{1}} \right\rbrack}\Delta_{\cos\quad\theta_{1}}} + \Delta_{\cos\quad\theta_{1}}^{2}}{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}}.}} & (5.49) \end{matrix}$ Because (5.28) and (5.35) imply that Δ_(cos θ) ₁ <<[cos θ₁], we have Δ² _(cos θ) ₁ <<[cos θ₁]Δ² _(cos θ) ₁ , hence we can omit Δ² _(cos θ) ₁ in (5.49). Defining $\begin{matrix} {\delta = \frac{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack\Delta_{\cos\quad\theta_{1}}}{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}}} & (5.50) \end{matrix}$ then (5.49) becomes √{square root over (1+2δ)}. From (5.28) and (5.35) we must have δ≧0. Applying the mean-value theorem to √{square root over (1+2δ)}, we have $\begin{matrix} {\frac{\sqrt{1 + {2\delta}} - \sqrt{1 + 0}}{\delta - 0} = {\frac{1}{\sqrt{1 + {2\zeta}}} \leq 1}} & (5.52) \end{matrix}$ where 0≦ζ≦δ. Hence, √{square root over (1+2δ)}≦1+δ  (5.52) According to (5.35), $\begin{matrix} {\frac{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack}{\left\lbrack {\cos\quad\theta_{1}} \right\rbrack^{2} + \left( {\sin\quad\theta_{1}} \right)^{2}} < 1} & (5.53) \end{matrix}$ and therefore, from (5.28) and (5.50), we have 0≦δ<2^(−2N/3).

By definition, in (5.47), we have √{square root over (1+2δ)}=1+δ_([cos θ) ₁ _(] Thus δ) _([cos θ) ₁ _(]) ≦δ, Hence δ _([cos θ) ₁ _(]) is bounded by 0≦δ_([cos θ) ₁ _(])<2^(−2N/3).  (5.54)

According to (5.40) and (5.54), instead of storing the sin θ_(M) and cos θ_(M) values in ROM, we may store sin θ₁, which has N/3+1 bits for each sample, and [cos θ₁], which has 2N/3 bits. Given θ _(M), the sin θ₁ and [cos θ₁] values are retrieved from the ROM to be used in performing the coarse rotation. Since the actual angle θ_(m) differs from the θ_(M)=(π/4) θ _(M), we must also store the θ_(M)−θ_(m) values, so that the fine stage can compensate for the difference. The approximations (5.6) and (5.7) still apply to θ_(l), in view of (5.40). In addition, the change of magnitude in the rotation using the sin θ₁ and [cos θ₁] values, as seen in (5.45), must also be compensated. Therefore we store the δ_([cos θ) ₁ _(]) values in order to scale the coarse-stage output by 1+δ_([cos θ) ₁ _(]).

We can now implement the coarse rotation stage as in (5.29). Later we will show that the scale factor 1+δ_([cos θ) ₁ _(]) can be combined with the scaling that will be done for the second stage (i.e., the fine stage) at its output.

To compute θ_(l) we must first convert the normalized θ _(L) value to the radian value θ_(L), which involves a multiplication by π/4. Since π/4=2⁻¹⁺² ⁻²⁺² ⁻⁵⁺² ⁻⁸+2⁻¹³+ . . . , if we multiply 0≦ θ _(L)<2^(−N/3) by (2⁻¹+2⁻²+2⁻⁵+2⁻⁸), this product and (π/4) θ _(L) differ by no more than 2⁻¹²×2^(−N/3)=2^(−(N/3+12)), which is sufficiently small for a 12-bit system. (And two more bits would suffice for building a 16-bit system.)

5.3 Reduction of Multiplier Size in the Fine Stage

In the fine rotation stage, the computations involved in generating X₂ are $\begin{matrix} \begin{matrix} {X_{2} = {{X_{1}\left( {1 - {\theta_{l}^{2}/2}} \right)} - {Y_{1}\theta_{l}}}} \\ {= {X_{1} - {\left( {\theta_{l}^{2}/2} \right)X_{1}} - {Y_{1}{\theta_{l}.}}}} \end{matrix} & (5.53) \end{matrix}$ Since |θ_(l)|<^(2−N/3) it follows that θ_(l) can be expressed as θ_(l) =s.s . . . sθ _(N/3+1) . . . θ_(2N/3)θ_(2N/3+1) . . .   (5.56) where s is the sign bit. The N/3 MSBs do not influence the result. This property helps to reduce the size of the multipliers that implement (5.55). Even more savings in hardware can be achieved by further reducing multiplier size, with just a small loss of accuracy.

Let [Y₁] represent the 2N/3 MSBs of Y₁ as in Y ₁ =s.y ₁ . . . y _(2N/3) y _(2N/3+1) . . . =[Y ₁]+Δ_(Y) ₁ .  (5.57) Then we must have |Δ_(Y) ₁ |2^(−2N/3). The error contributed to the product Y₁θ_(l) by using [Y₁] instead of Y₁ is |Y ₁θ_(l) −[Y ₁]θ_(l)|=|Δ_(Y) ₁ θ_(l)|<2^(−N).  (5.58) Therefore, for N-bit precision, the multiplication Y₁θ_(l) can be accomplished with a (2N/3)×(2N/3) multiplier.

This method can be applied to the computation of θ_(l) ²/2. Defining [θ_(l)] as the 2N/3 MSBs of θ_(l), and letting Δ_(θ) ₁ denote the remaining LSBs, we have [θ_(l) ]=s.s . . . sθ _(N/3+1) . . . θ_(2N/3)  (5.59) and Δ_(θ) _(l) =θ_(2N/3+1) . . .   (5.60) The error in calculating θ_(l) ²/2 using [θ_(l)] instead of θ_(l) is |([θ_(l)]+Δ_(θ) _(l) )²−[θ_(l)]²|/2≈|[θ_(l)]Δ_(θ) _(i) |<2^(−N).  (5.61) Thus θ_(l) ² can be implemented with an (N/3)×(N/3) multiplier, since the N/3 MSBs of [θ_(l)] are just sign-bits. 5.4 Scaling Multiplier Simplification

As mentioned in Section 5.2, the scale factor 1+δ_([cos θ) ₁ _(]) can be applied at the output of the fine stage. A straightforward implementation would use the full wordlength of 1+δ_([cos θ) ₁ _(]) in the product X=X₂ (1+δ_([cos θ) ₁ _(])), which would require a multiplier of size N×N. But this multiplier's size can be reduced as follows: According to (5.54), 0≦δ_([cos θ) ₁ ]<2^(−2N/3). Moving the factor 1+δ_([cos θ) ₁ _(]) into the fine stage, we have $\begin{matrix} {X_{2} = {{{X_{1}\left( {1 - {\theta_{l}^{2}/2}} \right)}\left( {1 + \delta_{\lbrack{\cos\quad\theta_{1}}\rbrack}} \right)} - {Y_{1}{\theta_{l}\left( {1 + \delta_{\lbrack{\cos\quad\theta_{1}}\rbrack}} \right)}}}} & (5.62) \\ {\quad{= {X_{1} + {X_{1}\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - {\theta_{l}^{2}/2}} \right)} - {Y_{1}{\theta_{l}.}}}}} & (5.63) \end{matrix}$ The only significant error in approximating (5.62) by (5.63) is the absence of the θ_(l)δ_([cos θ) ₁ _(]) term in the factor multiplying Y₁. But this is tolerable since, according to (5.54) and (5.40), |θ_(l)δ_([cos θ) ₁ _(])|<2^(−N)  (5.64) In view of (5.40) we have 0≦θ_(l) ²2^(−2N/3) which, combined with (5.54), yields |δ_([cos θ) ₁ _(]−θ) _(l) ²/2|<2^(2N/3).  (5.65) Thus, if we truncate δ_(cos θ) _(m) −θ_(l) ²/2 to N bits, only the least significant N/3 bits in the truncated result will be non-sign bits. Therefore, in our computation of X₁(δ_(cos θ) _(m) −θ_(l) ²/2) in (5.63), if we truncate X₁ to N/3 bits, we can use an (N/3)×(N/3) multiplier, with the product's error bound being |δ_([cos θ) ₁ _(]−θ) _(l) ²/2|2^(−N/3)<2^(−N).  (5.66)

By merging the scale factor of the coarse stage into the fine stage, we thus replace multiplications by the scale factor by additions. The final architecture is shown in FIG. 39, where the size of the multipliers is shown in FIG. 40.

FIG. 39 illustrates an angle rotator 3900 according to embodiments of the invention. The angle rotator 3900 includes a ROM 3902, a fine adjustment circuit 3904, a first butterfly circuit 3908, and a second butterfly circuit 3910. The angle rotator 3900 rotates an input complex signal 3906 according to angle θ to produce a rotated complex output signal 3912. The angle θ can be broken down into a most significant portion (or word) θ_(M) and least significant portion (word) θ_(L). Note that normalized angle values are shown in FIG. 39, as represented by the θ nomenclature. However normalized angle values are not required, as will be understood by those skilled in the arts.

The ROM 3902 stores the following for each corresponding θ: sin θ₁, [cos θ₁], δ_(cos θ) ₁ _(]), and θ_(M)−θ_(m), where all of these values have been exactly defined in preceding sections. To summarize, the sin θ₁ and [cos θ₁] values are MSBs of sin θ_(M) and cos θ₁, respectively. The δ_([cos θ) ₁ _(]) error value represents the difference between the cos θ_(M) and the [cos θ₁] value. (The exact definition for δ_([cos θ) ₁ _(]) is given in (5.47)) Likewise, the (θ_(M)−θ_(m)) error value represents the difference between sin θ_(M) and the sin θ₁ value. (The exact definition for θ_(m) is given in equation (5.30))

The butterfly circuit 3908 includes multiple multipliers and adders as shown. The implementation of these multipliers and adders is well known to those skilled in the arts. In embodiments, the sizes of the multipliers and adders are as shown in FIG. 40. Note that savings are obtained on the size of the multipliers because of bit truncated approximations that are described above. This produces a faster and more efficient angle rotator compared to other angle rotator schemes.

The operation of the angle rotator 3900 is further described in reference to the flowchart 4100. As with all flowcharts herein, the order of the steps is not limiting, as one or more steps can be performed simultaneously (or in a different order) as will be understood by those skilled in the arts.

In step 4102, the input complex signal is received.

In step 4104, the sin θ₁, cos [θ₁], δ_([cos θ) ₁ _(]), and θ_(M)−θ_(m) values are retrieved from the ROM 3902, based on the rotation angle θ.

In step 4106, the butterfly circuit 3908 multiplies the input complex signal by the sin θ₁ and [cos θ₁] values to perform a coarse rotation of the input complex signal, resulting in an intermediate complex signal at the output of the butterfly circuit 3908.

In step 4108, the adder 3914 adds the θ_(L) value to the error value θ_(M)−θ_(m) to produce a θ_(l) angle.

In step 4110, a fine adjustment circuit 3904 generates a fine adjust value $\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - {\frac{1}{2}\theta_{l}^{2}}} \right)$ based on the θ_(l)/angle and δ_([cos θ) ₁ _(]).

In step 4112, the butterfly circuit 3910 multiplies the intermediate complex signal by the θ_(l) angle, and the fine adjustment value $\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - {\frac{1}{2}\theta_{l}^{2}}} \right)$ to perform a fine rotation of the intermediate complex number, resulting in the output complex signal 3912.

In embodiments, the ROM 3902 storage space is 2^(N/3) words, where N is the bit size of the real or imaginary input complex number 3906. Therefore, the overall size of the ROM 3902 can be quite small compared with other techniques. This occurs because of the two-stage coarse/fine rotation configuration of the angle rotator 3900, and saving of storing sin θ₁, [cos θ₁] instead of sin θ and cos θ. Also, there is another advantage to having a small ROM: in certain technologies it is awkward to implement a ROM. Thus, if only a small ROM is needed, it is possible to implement the ROM's input/output relationship by combinatorial logic circuits instead of employing a ROM. Such circuits will not consume an unreasonable amount of chip area if they need only be equivalent to a small ROM.

5.5 Computational Accuracy and Wordlength

In this section we study the effect of quantization errors on the final output's computational accuracy and the most efficient way to quantize the data for a given accuracy.

In our algorithm, the errors can be classified into three categories. The first category is the quantization of the values in the ROM table. The second category is the error due to the truncation of data before multiplications, to reduce multiplier size. The third type of error is that resulting from approximating sin θ_(l) by θ_(l). Quantization errors are marked in FIG. 40 with an E marker as shown. The total error can be obtained by combining the errors propagated from each source. To calculate the propagated error at the output with a given error at the source, we can first identify all paths by which the error reaches the output and then use the approach discussed in Section 5.1.3. Let us first examine all the error sources and determine their effects on X, which is the real component of the output complex signal 3912. Table 5.1 displays this information. (Similar results apply to Y.)

The values stored in the ROM are sin θ_(l), [cos θ₁], θ_(M)−θ_(m) and δ_([cos θ) ₁ ], where sin θ₁ and [cos θ₁] are MSBs of sin θ_(M) and cos θ₁, respectively. A loss of precision due to ROM quantization error depends only on the number of bits used in representing θ_(M)−θ_(m) and δ_([cos θ) ₁ _(]). TABLE 5.1 Effect of errors at the X output Error source Error at the output E₁ quantizing (θ_(M) − θ_(m)) in ROM Y₁E₁ E₂ quantizing  (δ_([cos   θ₁]))  in  ROM Y₁E₂ E₃ truncating Y₁ for Y₁θ_(l) −θ_(l)E₃ E₄ ${truncating}\quad X_{1}\quad{{for}\quad\left\lbrack {X_{1}\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - \frac{\theta_{l}^{2}}{2}} \right)} \right\rbrack}$ $E_{2}\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - \frac{\theta_{l}^{2}}{2}} \right)$ E₅ truncating θ_(l) for θ_(l) ² −θ_(l)X₁E₅ E₆ ${truncating}\quad\theta_{l}^{2}\quad{{for}\quad\left\lbrack {X_{1}\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - \frac{\theta_{l}^{2}}{2}} \right)} \right\rbrack}$ Y₁E₆ E₇ ${{quantizing}\quad\theta_{L}} = {\left( \frac{\pi}{4} \right){\overset{\_}{\theta}}_{L}}$ Y₁E₇ E₈ quantizing X at the output E₈ E₉ approximating sin θ_(l) by θ_(l) $Y_{1}\left( \frac{\theta_{l}^{3}}{6} \right)$ E₁₀ neglecting  δ_([cos   θ₁])θ_(l)  in  (5.62) Y₁ The total error in X can be obtained by combining all the terms in the third column of Table ?5.1:

$\begin{matrix} {{Y_{1}\left( {E_{1} + E_{7}} \right)} + {Y_{1}{\theta_{l}\left( {\frac{\theta_{l}^{2}}{6} - \delta_{\lbrack{\cos\quad\theta_{1}}\rbrack}} \right)}} + {X_{1}\left( {E_{2} + E_{6}} \right)} - {X_{1}\theta_{l}E_{5}} - {\theta_{l}E_{3}} + {\left( {\delta_{\cos\quad\theta_{m}} - \frac{\theta_{l}^{2}}{2}} \right)E_{4}} + E_{8}} & (5.67) \end{matrix}$

Since E₆ in Table 5.1 is a truncation error, we have E₆>0. If we quantize δ_([cos θ) _(l) _(]) by rounding it upward before storing it in ROM, then E₂≦0. This way such errors tend to cancel each other. Cancelling errors are grouped together in (5.67) since the magnitude of their combined error is no greater than the larger of the two. This yields seven terms in (5.67), each contributing a maximum possible error of 2^(−N). If the multiplier sizes are as indicated in FIG. 40, the total error in X is bounded by 7×2^(−N).

From the above analysis it can be seen that the computation errors resulting from hardware reduction have similar magnitudes and no particular source dominates. This seems to provide the best trade-off between the hardware complexity and the accuracy of the entire system.

According to (5.67), the total output error can be reduced by increasing the internal data wordlength and the wordlength of each sample in the ROM. For each bit increase, we get one more bit of precision at the output. Therefore, we can design the processor to have the minimum hardware for a given precision requirement. Next, we give a simulation example to illustrate this method.

Example: A cosine waveform with an error less than 2⁻¹² is specified. According to (5.67), we chose N=15, as indicated in FIG. 40. We obtained the maximum error to be approximately 5×10⁻⁵, which is considerably smaller than 2⁻¹².

In FIG. 40, the ROM is shown as having $2^{\frac{N}{3}}$ words to achieve no more than a total error of 7×2^(−N) in the X output. If N is not a multiple of 3, we can choose the smallest N′>N that is a multiple of 3. Having $2^{\frac{N^{\prime}}{3}}$ words in ROM, of course, suffices to achieve the required precision. As discussed before, the total output error is a combination of errors from various sources, such as from quantizing the data before multiplications and from approximating sin θ_(l) by θ_(l), etc. However, our error bound estimation is rather conservative. Hence, the ROM size can be perturbed to determine the minimum size to satisfy a specific precision requirement. Our experience in designing the angle-rotation processor has shown that, even by rounding $\frac{N}{3}$ down to determine the ROM size, the total error is still less than 7×2^(−N). 5.6 Comparison with the Single-Stage Mixer

As mentioned earlier, the main advantage of the two-stage angle rotator is that it requires only a small ROM 3902. For the single-stage angle rotation, the ROM size grows exponentially with the precision of the angle. Thus, our two-stage method is well-suited for applications where more than 14 bits in the input angle are required. In this case, the sine lookup table for the single-stage angle-rotator, even with compression, is too large for high-speed operations (Vankka, J., “Methods of mapping from phase to sine amplitude in direct digital synthesis,” IEEE Trans. Ultrasonics, Ferroelectronics and Freq. Control 44:526-534 (1997)). However, the following comparison of our method to a well-known single-stage method with 14-bit input angle shows that even in this case our method has advantages, and this is true even when the single-stage method is optimized for that particular precision requirement.

To compare, we use the quadrature direct digital frequency synthesizer/mixer (QDDFSM) with 14-bit input angle and 12-bit input data that is reported in (Tan, L. and Samueli, H., “A 200-MHz quadrature frequency synthesizer/mixer in 0.8-μm CMOS,” IEEE J Solid-State Circuits 30:193-200 (1995)). It achieves 84.3 dB spurious free dynamic range (SFDR). According to this method, the sine and cosine values are generated using a DDFS, which employes lookup tables for these values. To reduce the ROM size, ROM compression techniques are used. The DDFS is followed by four 12×12 real multiplications.

For our structure, we chose the internal wordlengths and multiplier sizes as indicated in FIG. 42. The phase-accumulator that generates θ, as well as the circuit that maps an angle in the range [0, 2π] into [0, π/4], are described in (Madisetti, A., “VLSI architectures and IC implementations for bandwidth efficient communications,” Ph.D. dissertation, University of California, Los Angeles (1996)). These structures are also employed here in our test. Truncating the 32-bit phase word to 14 bits, this structure has achieved a SFDR of 90.36 dB, as shown in FIG. 43. This is 6 dB better than the single-stage method.

The integrated circuit that implements this structure is currently being built. A preliminary estimation of its hardware complexity yields a similar transistor count as that of (Tan, L. and Samueli, H., IEEE J Solid-State Circuits 30:193-200 (1995)). Thus, using approximately the same number of transistors, our structure achieves a 6 dB performance gain. Our structure requires a much smaller ROM (17×25=425 bits) in comparison to the single-stage method, which needs a 3072-bit ROM when the ROM compression technique is employed. Since the ROM access is hard to pipeline, it is usually the bottleneck in the data path, thereby limiting the achievable data rate. Hence, one pronounced benefit of having a much smaller ROM would be the much faster ROM access. Also, there is another advantage to having a small ROM: in certain technologies it is awkward to implement a ROM. Thus, if only a small ROM is needed, it is possible to implement the ROM's input/output relationship by combinatorial logic circuits instead of employing a ROM. Such circuits will not consume an unreasonable amount of chip area if they need only be equivalent to a small ROM.

5.7 A Modified Structure When Only One Output is Needed

In some applications, such as the implementation of the trigonometric interpolator discussed in the previous sections, only one output, say X is needed. In such cases, obviously, we can eliminate certain computations used to generate Y. However, using the angle rotator 3900, only those generating Y in the fine stage are subject to deletion, while the coarse stage must remain the same, since we need both X₁ and Y₁ to generate the X output. Let us seek to further simplify the coarse stage by attempting to eliminate one multiplication by cos θ_(M).

5.7.1 Modifications to the Coarse Stage

If we factor out the cos θ_(M) term of the coarse stage in (5.16), we can then apply the factor cos θ_(M) to the output of the second stage in (5.17), because the two operations (scaling and rotation) are permutable, to obtain X ₁ =X ₀ −Y ₀ tan θ_(M) Y ₁ =Y ₀ +X ₀ tan θ_(M)  (5.68) $\begin{matrix} {{X = {\cos\quad{\theta_{M}\left( {{X_{1}\left( {1 - \frac{\theta_{L}^{2}}{2}} \right)} - {Y_{1}\theta_{L}}} \right)}}}{Y = {\cos\quad{\theta_{M}\left( {{Y_{1}\left( {1 - \frac{\theta_{L}^{2}}{2}} \right)} - {X_{1}\theta_{L}}} \right)}}}} & (5.69) \end{matrix}$ In this case, we have only two multipliers in the coarse stage (5.68), and the multiplications by the scale factor θ_(M) are applied to the output of the fine stage (5.69). Unlike the situation in (5.16) and (5.17), if only one output from the angle rotator, say X, is needed, we can also eliminate one more multiplier—the one that multiplies the coarse stage output with the cos θ_(M) factor. As in Section 5.2, we now seek to simplify the coarse stage in (5.68).

Let tan θ_(m) be tan θ_(M) rounded upward at the (N/3)-rd bit. In other words, writing θ_(M) as the binary number tan θ_(M)=0.b ₁ . . . b _(N/3) b _(N/3) b _(N/3+1) . . . ,  (5.70) where b_(n)ε{0, 1}, tan θ_(m) is obtained from tan θ_(M) according to tan θ_(m)=0.b ₁ . . . b _(N/3)+2^(−N/3).  (5.71) Obviously, 0≦tan θ_(m)−tan θ_(M)≦2^(−N/3).  (5.72) The N/3-bit number tan θ_(m) decreases the number of partial products needed in computing X₀ tan θ_(m) and Y₀ tan θ_(m) to at most a third of those needed for X₀ tan θ_(M) and Y₀ tan θ_(M).

The resulting fine-stage angle is θ_(l)=θ−θ_(m). Thus, as in Section 5.2, a modified fine-stage angle compensates for a simplified coarse-stage angle. If θ_(l) satisfies (5.40), we then have |sin θ_(l)−θ_(l)|<2^(−N)/6. That is, the approximations sin θ_(l)=θ_(l) and cos θ_(l)=1−θ_(l) ²/2 can be applied. The proof that (5.40) holds is as follows: Proof. According to the mean value theorem $\begin{matrix} {\frac{{\tan\quad\theta_{m}} - {\tan\quad\theta_{M}}}{\theta_{m} - \theta_{M}} = {\tan^{\prime}\xi}} & (5.73) \end{matrix}$ where ξ=θ_(M)+(θ_(m)−θ_(M))h, 0≦h≦1. The derivative tan′ξ satisfies tan′ξ=1+(tanξ)²≧1, for every ξ.  (5.74) Re-arranging (5.73), and using (5.74), we have $\begin{matrix} {{\theta_{m} - \theta_{M}} = {\frac{{\tan\quad\theta_{m}} - {\tan\quad\theta_{M}}}{\tan^{\prime}\xi} \leq {{\tan\quad\theta_{m}} - {\tan\quad{\theta_{M}.}}}}} & (5.75) \end{matrix}$ Hence, according to (5.72), 0≦θ_(m)−θ_(M)≦2^(−N/3).  (5.76) By definition, 0≦θ_(L)<2^(−N/3).  (5.77) Therefore, subtracting (5.76) from (5.77) yields −2^(−N/3)<θ_(L)−(θ_(m)−θ_(M))<2^(−N/3).  (5.78) which is exactly (5.40) because θ_(l)=θ−θ_(m)=θ_(M)+θ_(L)−θ_(m)=θ_(L)−(θ_(m)−θ_(M)).  (5.79) This concludes our proof.

This indicates that, instead of storing the tan θ_(M) values in the ROM, we may store tan θ_(m), which has N/3 bits for each sample, and we may store θ_(m)−θ_(M). This results in a reduction of the multiplier size in the coarse stage. The difference between θ_(m) and θ_(M) can be compensated in the following fine rotation stage. Furthermore, the approximations (5.6) and (5.7) still apply to θ_(l), in view of (5.40).

We can now implement the coarse rotation stage as follows: X ₁ =X ₀ −Y ₀ tan θ_(m) Y ₁ =Y ₀ +X ₀ tan θ_(m).  (5.80) Accordingly, the scale-factor at the output of the fine stage is cos θ_(m) instead of cos θ_(M). Since θ_(l), satisfies (5.40), the fine stage simplification is similar to the method described in Section 5.3. Next we examine how the multiplications of the fine-stage output by cos θ_(m) can be simplified.

5.7.2 Scaling Multiplier Simplification

A straightforward implementation would use the full wordlength of cos θ_(m), in the product X═X₂ cos θ_(m), which would require a multiplier of size N×N. But this multiplier's size can be reduced as follows: By defining [cos θ_(m)] as the 2N/3+1 MSBs of cos θ_(m), the scale factor can be written as $\begin{matrix} {{\cos\quad\theta_{m}} = {{\left\lbrack {\cos\quad\theta_{m}} \right\rbrack + \Delta_{\cos\quad\theta_{m}}} = {\left\lbrack {\cos\quad\theta_{m}} \right\rbrack{\left( {1 + \frac{\Delta_{\cos\quad\theta_{m}}}{\left\lbrack {\cos\quad\theta_{m}} \right\rbrack}} \right).}}}} & (5.81) \end{matrix}$ Let us define $\delta_{\cos\quad\theta_{m}} = \frac{\Delta_{\cos\quad\theta_{m}}}{\left\lbrack {\cos\quad\theta_{m}} \right\rbrack}$ and, since 0≦θ_(m)≦/4, we surely have [cos θ_(m)]>0.5, and hence 0≦δ_(cos θ) _(m)<2×2^(−2N/3−1)  (5.82) Moving the factor 1+δ_(cos θm) into the fine stage, we have $\begin{matrix} {X_{2} = {{{X_{1}\left( {1 - {\theta_{l}^{2}/2}} \right)}\left( {1 + \delta_{\cos\quad\theta_{m}}} \right)} - {Y_{1}{\theta_{l}\left( {1 + \delta_{\cos\quad\theta_{m}}} \right)}}}} & (5.83) \\ {\quad{= {X_{1} + {X_{1}\left( {\delta_{\cos\quad\theta_{m}} - {\theta_{l}^{2}/2}} \right)} - {Y_{1}{\theta_{l}.}}}}} & (5.84) \end{matrix}$ The only significant error in approximating (5.83) by (5.84) is the absence of the θ₁δ_(cos) _(m) term in the factor multiplying Y₁. But this is tolerable since, according to (5.40) and (5.82), |θ_(l)δ_(cos θ) _(m) |<2^(−N).  (5.85) In view of (5.40) we have 0≦θ_(l) ²<2^(−2N/3) which, combined with (5.82), yields |δ_(cos θ) _(m) −θ_(l) ²/2|<2^(−N/3).  (5.86) Thus, if we truncate δ_(cos θ) _(m) −θ_(l) ²/2 to N bits, only the least significant N/3 bits in the truncated result will be non-sign bits. Therefore, in our computation of X₁(δ_(cos θ) _(m) −θ_(l) ²/2) in (5.84), if we truncate X₁ to N/3 bits, we can use an (N/3)×(N/3) multiplier, with the product's error bound being |δ_(cos θ) _(m) −θ_(l) ²/2|2^(−N/3)<2^(−N).  (5.87)

The factorization of cos θ_(m) in (5.81) allows a reduction of the multiplier to approximately ⅔ its original size. In this case, the values of [cos θ_(m)] and δ_(cos θ) _(m) are stored in the ROM instead of cos θ_(m).

The modified structure for one output is illustrated as angle rotator 4400 in FIG. 44. The angle rotator 4400 includes a ROM 4402, a fine adjustment circuit 4404, a first butterfly circuit 4408, and a second butterfly circuit 4410. The angle rotator 4400 rotates an input complex signal 4406 according to angle θ to produce a rotated complex output signal 4412. As with the rotator 3900, the angle θ can be broken down into a most significant portion (or word) θ_(M) and least significant portion (word) θ_(L). Note that normalized angle values are shown in FIGS. 39, 40, 42, and 44, as represented by the θ nomenclature. However normalized angle values are not required, as will be understood by those skilled in the arts.

The ROM 4402 stores the following for each corresponding normalized θ: tan θ_(m), [cos θ_(m)], δ_(cos θ) _(m) , and θ_(M)−θ_(m), where all of these values have been exactly defined in preceding sections.

In the butterfly circuit 4410, the arithmetic units that are encircled by the line 4418 can be eliminated when only the X output is needed in the output signal 4412. This may be desirable for applications where only one output from the angle rotator 4400 is needed, such as when implementing a trigonometric interpolator, such as interpolator 1000 in FIG. 10 or interpolator 1400 in FIG. 14.

The operation of the angle rotator 4400 is further described in reference to the flowchart 4500 in FIG. 45. As with all flowcharts herein, the order of the steps is not limiting, as one or more steps can be performed simultaneously (or in a different order) as will be understood by those skilled in the arts.

In step 4502, the input complex signal 4406 is received.

In step 4504, the tan θ_(m), [cos θ_(m)], δ_(cos θ) _(m) , and θ_(M)−θ_(m) values are retrieved from the ROM 4402, based on the rotation angle θ (or the normalized value θ).

In step 4506, the butterfly circuit 4408 multiplies the input complex signal 4406 by tan θ_(m) to perform a coarse rotation of the input complex number, resulting in an intermediate complex signal at the output of the butterfly circuit 4408.

In step 4508, the adder 4414 adds the θ_(L) value to the error value θ_(M)−θ_(m) to produce a θ_(l) angle.

In step 4510, a fine adjustment circuit 4404 generates a fine adjust value $\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - {\frac{1}{2}\theta_{l}^{2}}} \right)$ based on the θ_(l) angle and δ_(cos θ) _(m) .

In step 4512, the butterfly circuit 4410 multiplies the intermediate complex signal by the θ_(l) angle, and the fine adjustment value $\left( {\delta_{\lbrack{\cos\quad\theta_{1}}\rbrack} - {\frac{1}{2}\theta_{l}^{2}}} \right)$ to perform a fine rotation of the intermediate complex signal, resulting in the output complex signal.

In step 4514, the X value for the output complex signal is scaled by the [cos θ_(m)] value, resulting in the output complex number 4412. As discussed above, the elements inside the outline 4418 can be eliminated if only the X value of signal 4412 is desired. Alternatively, similar elements could be eliminated from the butterfly circuit 4410 if only the Y value of signal 4412 was desired.

5.8 Application of Angle Rotation Processors

This subsection describes exemplary applications for angle rotator processors. These applications are provided for example purposes only and are not meant to be limiting, as those skilled in the arts will recognize other applications based on the discussions given herein. These other applications are within the scope and spirit of the present invention.

One application for the angle rotation processor is the Quadrature Direct Digital Frequency Synthesizer/Mixer (QDDFSM), including a few special cases that are candidates for the angle rotator algorithm. One is the case when only one of the outputs (X or Y) is desired, as shown by angle rotator 4400 (FIG. 44). As shown in FIG. 44, this is accomplished by simply deleting the hardware required for the computation of the unused output. Yet another special case of QDDFSM is the Direct Digital Frequency Synthesizer (DDFS). In DDFS configuration we simply fix the input vector (X₀, Y₀) to be (1,0). This enables the complete elimination of the coarse stage by taking advantage of the fact that 1×A=A and 0×A=0. In the following section we will concentrate our discussion on the QDDFSM, since it is the general case, while keeping in mind the special cases and the associated hardware reductions mentioned above.

5.8.1 Using the Angle Rotation Processor in a Quadrature Direct Digital Frequency Synthesizer/Mixer

The frequency synthesis and mixing operation can be described with the following pair of equations, which relate an input with x-y coordinates (X₀, Y₀) and a frequency control word (fcw) for the synthesizer, to an output with new x-y coordinates (X, Y). The following pair of equations establishes the relationship between (X₀, Y₀), fcw, and (X, Y). X=[X ₀×cos(fcw×n)]−[Y ₀×sin(fcw×n)] Y=[Y ₀×cos(fcw×n)]+[X ₀×sin(fcw×n)]  (5.88)

-   -   where n is the time index

Per (5.88), since the sine and cosine functions are periodic with period 2π (i.e., fcw×n=<fcw×n>_(2π)=φ, where <> is a modulo operator) an overflowing adder is used as a phase accumulator to compute φ from the input fcw, as shown by the phase accumulator 4600 in FIG. 46.

Now, for any given time instance n, we have a corresponding angle φ from the phase accumulator, hence the original pair of equations (5.88) for QDDFSM can be rewritten in terms of the angle φ as follows. X=[X ₀×cos φ]−[Y ₀×sin φ] Y=[Y ₀×cos φ]+[X ₀×sin φ]  (5.89)

Note that the expressions (5.89) are exactly those of an angle rotator expressed by equations (5.1). By applying a phase accumulator fed by an fcw, we have converted the QDDFSM into an angle rotation application. The only conflict between the above expressions and the angle rotation processor is that the angle rotation processor takes an angle θ in the range [0, π/4], while the angle φ in the above expressions is in the interval [0,2π).

5.8.1.1 A General Angle Rotator for Arbitrary Input Angles

Let us consider the changes necessary to make the angle rotation processor use an input angle φ that may lie outside the [0, π/4) range. Fortunately, a simple interchange operation at the input of the coarse stage, and an interchange/negate operation at the output of the fine stage is all we need in order to map φ into an angle θ in the range [0, π/4] and use it as the input to the angle rotator. Even though the input angle θ is in the range [0, π/4], the rotation by θ along with the interchange and interchange/negate operations make the overall rotation of the input (X₀, Y₀) equivalent to a rotation by the original angle φ in the full range [0,2π). The latter is possible because of the convenient symmetry properties of sine and cosine functions over the range [0, 2π].

For example, sin φ=−sin(φ−π) and cos φ=−cos(φ−π), while sin φ=cos(φ−π/2) and cos φ=−sin(φ−π/2), and finally, for 0<φ<π/4, if we write π/4+φ for φ then sin(π/4+φ)=cos(π/4−φ) and cos(π/4+φ)=sin(π/4−φ). Using the first pair of trigonometric identities, we can map θ into the range [0, π]) by simply performing a negate operation at the output of the angle rotator. Using the second pair of identities along with the first pair enables one to map φ into the range [0, π/2) by performing negate and interchange operations at the output of the angle rotator. Finally, using all three pairs of identities, the angle φ can be mapped into the range [0, π/4) by performing an interchange operation at the input of the angle rotator, along with interchange and negate operations at the output of the angle rotator. Note that all of these interchange and negate operations are conditioned only on the issue of which octant φ is in. This means that if φ is a normalized angle, then the interchange and negate decisions depend only on the top three MSB bits of φ. The following tables show the interchange and negate operations required for all eight octants (specified by the three MSB bits of φ). It is evident, as well, that other interchange and negate criteria for the input and output would also be suitable.

This table indicates when an interchange operation is required at the input and when an interchange operation is required at the output of the angle rotator. Octant of φ (3 MSBs of φ) Output Interchange Input Interchange 1-st octant (000) 2-nd octant (001) Interchange inputs 3-rd octant (010) Interchange outputs 4-th octant (011) Interchange outputs Interchange inputs 5-th octant (100) 6-th octant (101) Interchange inputs 7-th octant (110) Interchange outputs 8-th octant (111) Interchange outputs Interchange inputs

The following table indicates when a negation operation is required at the output of the angle rotator. Octant of φ (3 MSBs of φ) Negation of output X Negation of output Y 1-st octant (000) 2-nd octant (001) Negate output X 3-rd octant (010) Negate output Y 4-th octant (011) Negate output X Negate output Y 5-th octant (100) Negate output X Negate output Y 6-th octant (101) Negate output Y 7-th octant (110) Negate output X 8-th octant (111) Note that the flag for input interchange is simply the 3rd MSB bit of φ, while the flag for output interchange is just the 2nd MSB bit of φ. Finally, to produce the remapped angle θ in the range [0, π/4) for the angle rotation processor, we simply take the remaining bits of φ after stripping the top two MSBs and performing a conditional subtract operation to produce θ. More specifically, if the MSB bit (after stripping the two MSB bits) is low, i.e., the angle is in an even octant (numbering them 0, . . . , 7), we pass the angle unchanged, otherwise we perform a “two's-complement type” inversion of the angle. Note here that after such remapping operation, the MSB bit of θ is set to one only in the case when θ=/4. This fact is useful in determining the required amount of lookup table in the angle rotation processor. In other words, even though the MSB bit of θ is an address to the lookup table, since we know that when it is ‘1’ the remaining bits have to all be ‘0’ we only need to allocate a single address for that case (as opposed to increasing the size of the lookup table by an entire factor of two).

5.8.1.2 Adapting the General Angle Rotator to Make a QDDFSM

The structure of the QDDFSM using an angle rotation processor 3900 is depicted in the FIG. 4700. It simply requires the employment of a phase accumulator 4702 and a conditional subtract 4704 to provide an input angle from the input frequency control word fcw. We refer to the system of FIG. 47 with the phase accumulator excluded as a General Angle Rotator. It has the capability to receive an angle in the interval [0, 2π) and to perform an angle rotation of the input data (X₀, Y₀) by that angle. We show a general angle rotator in FIG. 48, but one in which further structural simplification has been made. The method of performing these simplifications will be discussed next.

5.8.2 How to Use the Conditionally Negating Multipliers in the General Angle Rotator

For a moment assume we have a powerful technique for making conditionally negating multipliers. What we mean by that is a multiplier which takes a negate flag to produce an output depending on that negate flag as follows: The output is simply the product of the input signals if the flag is low (0) and the output is the negative of the product of the input signals if the flag is high (1).

Each one of the two outputs in the coarse and fine stages is computed with two multipliers and one adder as shown in FIG. 47. These multipliers and the adder are implemented in a single Carry-Save Adder (CSA) tree, with the partial products being generated from Booth decode modules corresponding to the two multipliers. This technique of employing a single tree eliminates the need for intermediate carry propagation from each multiplier and makes the propagation delay of each rotation stage very short. Note that the single CSA tree implementation is possible since the multipliers are operating in parallel. Furthermore, because the structure that is needed to compute one output of a rotation stage is identical to the structure required by the other output (with the exception of the minus sign), a single CSA tree can easily be interleaved between the two outputs for a significant amount of hardware savings. The minus sign at the output of the multiplier can be implemented very efficiently by the technique described in the following sections (using the conditionally negating multiplier). The negation or non-negation of the multiplier output can be controlled with a flag that changes between the two cycles of the interleave operation.

The angle at the output of the conditional subtract module 4704 in FIG. 47 is in the range [0, n/4]. As already discussed, the outputs for the angles outside this range are constructed by mapping the angle into the range [0, π/4] while conditionally interchanging the inputs (inputs to the coarse stage) and conditionally interchanging and negating the outputs (outputs of the fine stage) of the angle rotator. A negation at the output of the fine stage simply means changing the output signs of the multipliers and negating the input of the adder coming from the input of the fine rotation stage. Changing the output signs of the multipliers is once again accomplished by using conditionally negating multipliers. The negation of the input to the fine rotation stage can easily be implemented with XOR gates and a conditional high or low bit insertion into the CSA tree at the position corresponding to the LSB location of the input. Since this conditional high or low bit is inserted in the CSA tree, there is no additional carry propagation introduced for the negation of the input. Note that the latter technique eliminates any circuitry required to implement the conditional negation of the outputs, and hence eliminates any carry propagations associated with two's complement numbers.

Furthermore, the conditional interchange of the outputs can be implemented by conditionally interchanging the inputs of the fine rotation stage and appropriately controlling the signs of the multiplier outputs in the fine stage. The conditional interchange of the fine stage inputs can be propagated to the inputs of the coarse stage with the same line of reasoning. Remember that the inputs to the coarse stage were conditionally interchanged according to the three MSBs of the input angle anyway. In conclusion, the conditional interchange and negation operations of the outputs can be implemented by modifying only the condition of the interchange at the inputs of the coarse stage and appropriately controlling the multiplier output signs by using conditionally negating multipliers (which we had to do for interleaving anyway). This eliminates the conditional negate and interchange block at the output of the fine stage entirely (i.e., it eliminates muxes and two's complement negators), and also eliminates the need for storing and pipelining control signals (i.e., it eliminates registers) to perform the conditional interchange and negation operations at the output. The resulting General Angle Rotator 4800 is now depicted in the following FIG. 48.

5.8.2.1 Booth Multiplier

There are many algorithms for digital multiplication. One of the most popular is the Booth multiplier. The essence of the Booth multiplier is in the decoding scheme performed on the multiplicand to reduce the number of partial products which, when added together, produce the desired product. For an N×M Booth multiplier, where N is the wordlength of the multiplier, and M is the wordlength of the multiplicand, there will be ceiling(N/2) Booth decoders. Each Booth decoder will take three bits from the multiplier (with one bit overlapping the decoders on both sides) and will manipulate the multiplicand according to the Booth decoding table 5000 shown in FIG. 50. Some relevant details for a 10×M Booth multiplier are depicted in FIG. 49, especially how the multiplier bits feed into the Booth decoders to produce the five partial products which, when added, compute the result (the product of the multiplier and the multiplicand).

5.8.2.2 How to Make a Negating Booth Multiplier

Suppose we wish to make a multiplier that produces the negative of the product. More specifically, suppose we wish to multiply two signals N and M and get −C=−(N×M). The latter can be accomplished in a number of different ways. The most obvious is perhaps to use a regular multiplier to produce the product C=(N×M) and then negate C to achieve −C=−(N×M). In case of two's complement representation, this approach requires an additional carry propagation chain through the negator, which is costly in terms of speed and additional hardware associated with a negating circuit. Another approach, described below, is more favorable in a few key aspects.

The product C is essentially the result of adding a number of partial products, which are generated by the Booth decode blocks as described in the previous section. Therefore, we can write the following sum expression for C: $\begin{matrix} {C = {\sum\limits_{i = 1}^{n}p_{i}}} & (5.90) \end{matrix}$ where p_(i) are the n (in the 10×M example above n=5) partial products generated from the n Booth decoders. Note that, in order to negate C, we can negate all of the partial products and proceed with the summation of the negated partial products to produce −C. The expression for −C is then the following: $\begin{matrix} {{{- C} = {\sum\limits_{i = 1}^{n}{- p_{i}}}},} & (5.91) \end{matrix}$ where −p_(i) are the negated n partial products generated from the n Booth decoders. Let us investigate how the Booth decoders need to change to produce the desired negated partial products. All we need to do is to change the decoding table 5000 from that of FIG. 50, to the decoding table 5100 in FIG. 51. Note that the difference between the tables is only in the partial product columns and, more specifically, the partial product column 5102 of table 5100 is the negative of the partial product column 5002 of table 5000. This means that by simply modifying the Booth decode table to the negating Booth decode table shown in FIG. 51, the result will be the negative of the product, as desired, with absolutely no additional hardware and absolutely no speed penalty. An example for a 10×M negating Booth multiplier 5200 is shown in FIG. 52.

5.8.2.3 How to Make a Conditionally Negating Booth Multiplier

A particularly interesting case arises when one wishes the multiplier product to be negated sometimes, and normal (non-negated) the other times. One can extend the idea presented in the previous section to craft the following powerful technique. Let us investigate the original Booth decode table 5000 depicted in FIG. 50 and the negating Booth decode table 5100 of FIG. 51 a bit more closely. Note the horizontal line of symmetry that runs through the midline of both decoding tables. This line of symmetry suggests that we can create the negating Booth decode table 5100 from the original Booth decode table 5000 by simply inverting the three bits (b2 b1 b0). For example, if the three bits (b2 b1 b0) are (0 1 0), then, according to the original Booth decode table, the corresponding partial product is A, where A is the multiplicand. If we invert the three bits (b2 b1 b0) as suggested above, we will have (1 0 1) and the corresponding partial product will be −A, exactly what is needed for a negated partial product.

Given a signal F which specifies when the output of the multiplier should be negated and when not (F=0 implies regular multiplication, F=1 implies negating multiplication), F can simply be XORd with the three bits (b2 b1 b0) at the input of the regular Booth decoders to make a new conditionally negating Booth decoder, hence a conditionally negating multiplier. The details of a conditionally negating Booth decoder 5300 are captured in FIG. 53. Note that with a minimal amount of hardware (N XOR gates for an N×M multiplier, which is insignificant compared to the hardware cost of the entire multiplier), we have the means to control the sign of the multiplier product. Also note that the overall latency of the multiplier is increased insignificantly since the latency through a single XOR gate is much smaller than the latency through the entire multiplier. Furthermore, the latency of a single XOR gate is much smaller than the latency associated with a carry propagation chain that would be necessary if one built such a circuit with a two's complement negator. A 10×M conditionally negating multiplier 5400 is shown in FIG. 54.

5.8.3 Using the Angle Rotation Processor in a Quadrature Direct Digital Frequency Synthesizer

As mentioned above, the angle rotator is useful in implementing various forms of direct digital synthesizers. In this case, all starting points for the angle rotations are X₀=1, Y₀=0 (with, of course, the various usual interchange/negation requirements). FIG. 55 shows a quadrature direct digital synthesizer (QDDS) 5500, a system having two outputs, one being samples of a cosine waveform and the other being samples of a sine waveform. An exact 90-degree phase offset between the two waveforms is obtained by the QDDS, and numerous applications for such a device are well known. No X₀ and Y₀ input samples are shown in the FIG. 55 system. These fixed values have been “built in” and used to greatly simplify the coarse rotation stage.

Notice that the angle rotator 5502 is preceded by a system 5504 that generates a data stream of input rotation angles, a so-called overflowing phase accumulator 5506, and its input is a single fixed data word that precisely controls the frequency of the output sample waveforms. The three MSBs of each phase accumulator output word, of course, assess the approximate size of the angle that is being used as a rotation angle (i.e., these three bits show how many octants the rotation angle spans), and they are stripped off to control the interchange/negation operations that are appropriate for obtaining the desired output samples. Also, the third MSB is used, as described previously, to determine whether or not to perform a “two's complement type” inversion of the LSBs. One other operation is required by the “Conditional Subtract” module 5508 shown in FIG. 55; in addition to stripping off the three MSBs, it appends one MSB having the value zero except in the case where a rotation angle of exactly π/4 is required. In that case, the appended MSB is one and all other ROM-address bits are zero.

A special case of the QDDS system, one having-only a single output data stream, which could be either of the two, but which we call the “cosine-only” case, is also useful for various well-known applications. FIG. 56 and FIG. 57 show two specializations of the angle rotator circuits previously discussed to implement the cosine-only DDS. The system 5600 in FIG. 56 results from specializing the angle-rotation system 3900 in FIG. 39. The system 5700 in FIG. 57 is a specialization of the angle rotator 4400 in FIG. 44.

5.9 Conclusion

Based on the design method discussed, for a given accuracy requirement, an architecture with the least amount of hardware is produced by balancing the precision of intermediate computations and the complexity of each arithmetic block, while keeping the output error within the specified bound. Furthermore, our architecture consolidates all operations into a small number of reduced-size multipliers. This permits us to take advantage of many efficient techniques that have been developed for multiplier implementation, such as Booth encoding, thereby yielding a smaller and faster circuit than those previously proposed.

Simulations and preliminary complexity estimation show that, even comparing to the method of (Tan, L. and Samueli, H., IEEE J. Solid-State Circuits 30:193-200 (1995)) that is optimized for a 14-bit input angle, our method achieved 6 dB more SFDR while using approximately the same number of transistors as those needed by (Tan, L. and Samueli, H., IEEE J Solid-State Circuits 30:193-200 (1995)). In addition, since our structure employs only a small ROM, it overcomes the problem of slow access time that occurs when large ROMs are used, thereby facilitating a higher data rate. Using the two-stage method, when a higher precision is needed, it is very straightforward to satisfy such a requirement, since more accurate results can be attained simply by increasing the wordlength and the multiplier size. For the single-stage method, however, when high precision is desired, the required lookup table is likely to be too large to be practical, particularly for high-speed operation.

6. SYMBOL SYNCHRONIZATION FOR BURSTY TRANSMISSIONS

We have thus far discussed methods that provide efficient implementations of the resampler for symbol synchronization in a digital receiver using trigonometric interpolation as well as the phase rotator for carrier recovery. To produce the correct samples, a timing recovery circuit must supply the resampler with symbol timing information, as shown in FIG. 1D. We will now consider how this can be accomplished.

6.1 Initial Parameter Estimations for Burst Modems

There are many methods to derive timing information from the received signal. According to their topologies, synchronization circuits can be divided into two categories: there are feedback and feedforward schemes. Feedback structures usually have very good tracking performance, and they work quite well in continuous mode transmissions. For packet data systems used by third-generation mobile communications, where the transmission is bursty, it is essential to acquire initial synchronization parameters rapidly from the observation of a short signal-segment.

A typical packet format is shown in FIG. 58. It includes a short preamble 5802 followed by user data 5804. The preamble 5802 is a set of known modulation symbols added to the user data packet at the transmitter with the intention of assisting the receiver in acquisition.

There are many approaches to burst demodulation, depending on the specific system requirements. In one approach (S. Gardner, “Burst modem design techniques, part 1,” Electron. Eng. 71:85-92 (September 1999); Gardner, S., “Burst modem design techniques, part 2,” Electron. Eng. 71:75-83 (December 1999)), the receiver first detects the presence of the preamble, using a correlator, whose output should produce a large magnitude when the preamble is present. It then estimates the symbol timing. If the sampling frequency error is small, the total change of the timing phase from the start of the short preamble to the end is negligible. Next, it estimates the initial carrier frequency and phase. The above steps assume that the impairment caused by the channel is small enough that the modem can successfully track the timing carrier phase prior to equalization. Otherwise, equalizer training prior to the timing and carrier recovery is needed.

With a typical preamble of 8 to 32 symbols, depending on the required system performance, for QPSK modulation, rapid acquisition is desired. Feedforward timing estimation is known to have rapid acquisition, since it produces a one-shot estimate instead of tracking the initial timing through a feedback loop.

A well-known method, digital square timing recovery (Oerder M., and Meyr, H., IEEE Trans. Comm. 36:605-612 (1988)), has shown rapid acquisition, but it requires oversampling of the signal at, typically, four times the symbol rate, which imposes a demand for higher processing speed on the subsequent digital operations. Moreover, it does not work well for signals employing small excess bandwidth. However, pulses with small excess bandwidth are of interest for bandwidth-efficient modulation.

For applications where low power and low complexity are the major requirements, such as in personal communications, it is desirable to sample the signal at the lowest possible rate and to have the synchronizer be as simple as possible. In this section, a synchronizer is proposed that needs just two samples per symbol period. In addition, it has been shown to work well for small excess bandwidth, which is important for spectral efficiency. Using this method, the estimations of the symbol timing and the carrier phase can be carried out independently of each other. Hence, they can be carried out in parallel. Using the proposed structure, the timing and carrier-phase estimators can be implemented efficiently by means of direct computation (instead of a search, as is employed, for example, by (Sabel, L., and Cowley, W., “A recursive algorithm for the estimation of symbol timing in PSK burst modems,” in Proc. Globecom 1992, vol. 1 (1992), pp. 360-364) using an efficient rectangular-to-polar converter (to be discussed in Section 7). This yields a very small computation load. Thus, this structure is well suited for low-power, low-complexity and high-data-rate applications, such as those in multimedia mobile communications.

6.2 Background Information

The system model 5900 used in developing the symbol timing and carrier phase recovery algorithm described in this section is shown in FIG. 59.

Here h(t) is a real-valued, unit-energy square-root Nyquist pulse and w(t) is complex white Gaussian noise with independent real and imaginary components, each having power spectral density N₀/2.

As mentioned in Section 6.1, a typical data packet for a burst modem consists of a short preamble 5802 followed by user data 5804. According to the approach of (Gardner, S., Electron. Eng. 71:85-92 (September 1999)), the matched filter output is sampled every T_(s)=T/2 seconds, i.e., at twice the symbol rate. The receiver then detects the presence of the preamble in the received signal by correlating the conjugate of the known preamble sequence a_(m), whose length is L, with the sampled data x(nT_(s)) as $\begin{matrix} {{r_{xx}(n)} = {\sum\limits_{m = 0}^{L - 1}{a_{m}^{*}{{x\left( {{nT}_{s} + {2{mT}_{s}}} \right)}.}}}} & (6.1) \end{matrix}$ The correlator output r_(xx)(n) should produce a large magnitude |r_(xx)(n)| when the preamble is encountered. It then estimates the initial synchronization parameters, namely the symbol timing and the carrier phase, assuming the transmitter/receiver frequency mismatches are insignificant.

The complex envelope x(t) of the received signal, after the matched filter, is $\begin{matrix} {{x(t)} = {{{\mathbb{e}}^{j\theta}{\sum\limits_{k = {- \infty}}^{\infty}{a_{k}{g\left( {t - {kT} - \tau} \right)}}}} + {v(t)}}} & (6.2) \end{matrix}$ where {a_(k)} is a sequence of independent equally-probable symbols with E[|a_(k)|²]=1. We also have that v(t)=w(t){circle around (×)}h(−t) and that g(t)=h(t){circle around (×)}h(−t) is a Nyquist pulse. The time delay τ and the carrier phase θ are both unknown.

To estimate the data sequence a_(k) we want sample values of x(t) at t=mT+τ, with m an integer, whereas only the samples x(nT_(s)) are available after sampling x(t) by a fixed clock.

Now let us examine how the correlator output relates to symbol timing and carrier phase. Inserting (6.2) into (6.1) yields $\begin{matrix} {{r_{xx}(n)} = {{\sum\limits_{m = 0}^{L - 1}{\sum\limits_{k = {- \infty}}^{\infty}{a_{m}^{*}a_{k}{g\left( {{nT}_{s} + {2{mT}_{s}} - {kT} - \tau} \right)}{\mathbb{e}}^{j\theta}}}} + {\sum\limits_{m = 0}^{L - 1}{a_{m}^{*}{{v\left( {{nT}_{s} + {2{mT}_{s}}} \right)}.}}}}} & (6.3) \end{matrix}$ Since the data are independent, and they are independent of the noise, we have $\begin{matrix} {{E\left\lbrack {a_{m}^{*}a_{k}} \right\rbrack} = \left\{ \begin{matrix} 1 & {k = m} \\ 0 & {k \neq m} \end{matrix} \right.} & (6.4) \\ {{E\left\lbrack {a_{m}^{*}{v\left( {{nT}_{s} + {2{mT}_{s}}} \right)}} \right\rbrack} = 0.} & (6.5) \end{matrix}$ According to (6.4) and (6.5), and because T=2T_(s) the expectation of r_(xx)(n) with respect to the data and the noise is (for simplicity, we omit the constant real scale factor L) E[r _(xx)(n)]=e ^(jθ) g(nT _(s) −τ).  (6.6)

Thus, the mean value of the complex preamble correlator output actually equals the sample of the delayed signaling pulse g(t), with delay being τ, rotated by the angle θ. This is shown in FIG. 60 for θ=0, where g(t) is a raised cosine Nyquist pulse with α=0.35. The total timing delay τ can be expressed as τ=n ₀ T _(s)+μ  (6.7) where the integer n₀ represents the portion of τ that corresponds to an integer multiple of the sampling interval T_(s) and 0≦μ<T_(s) is the sampling time mismatch.

Most practical signaling pulses g(t) are symmetrical and their peak value occurs at g(0). If θ is known, using these properties, we can estimate the sampling time mismatch μ from the correlator output r_(xx)(n). In the next section we will discuss such an algorithm. We will derive this algorithm by first assuming that θ=0. Then we will discuss how the method can be carried out independently of the carrier phase. Simultaneously, we also derive a phase estimation algorithm that is independent of the symbol timing.

6.3 Symbol Timing Estimation Assuming θ=0

From (6.6), with θ=0, we have E[r _(xx)(n)]=g(nT _(s)−τ).  (6.8) According to (6.7) and (6.8), if the transmission delay τ is exactly an integer multiple of T_(s) we must have μ=0, and thus r_(xx)(n₀) must correspond to the peak g(0). Otherwise, we have μ≠0, with r_(xx)(n₀) and r_(xx)(n₀+1) being the two correlator output values nearest the peak value g(0), as shown in FIG. 60. That is, r_(xx)(n₀) and r_(xx)(n₀+1) must be the two largest correlator outputs. Therefore, once the largest correlator output is located, we can obtain n₀, the integer part of τ.

We now turn to finding μ. Without loss of generality, let us assume T_(s)=1. Replacing n by n₀+n we have, according to (6.8) and (6.7), E[r _(xx)(n ₀ +n)]=g((n ₀ +n)−τ)=g(n−μ).  (6.9) For simplicity in our discussion on finding the fractional delay μ, we henceforth drop the index n₀, which corresponds to an integer multiple of sample delays, from our notation. Next we define R(e^(jω)) as the Fourier transform of r_(xx)(n): $\begin{matrix} {{R\left( {\mathbb{e}}^{j\omega} \right)} = {\sum\limits_{n = {- \infty}}^{\infty}{{r_{xx}(n)}{{\mathbb{e}}^{{j\omega}\quad n}.}}}} & (6.10) \end{matrix}$ The expectation of R(e^(jω)) can be expressed as E[R(e ^(jω))]=E[FT(r _(xx)(n))]=FT(E[r _(xx)(n)]).  (6.11) According to (6.9), and (C.4) in Appendix C, we have E[R(e ^(jω))]=FT(g(n−μ))=e ^(jωμ) G(e ^(jω))  (6.12) where G(e^(jω)) is the Fourier transform of g(n). Since g(n) is symmetrical, G(e^(jω)) must have zero phase. Thus, according to (6.12), arg(E[R(e ^(jω))])=arg(e ^(jωμ) G(e ^(jω)))=ωμ.  (6.13) Evaluating (6.13) at ω=π/2, we can obtain an estimate of μ as $\begin{matrix} {\mu = {\frac{2}{\pi}\arg\quad{\left( {R\left( {\mathbb{e}}^{{j\pi}/2} \right)} \right).}}} & (6.14) \end{matrix}$ Therefore, the unknown sampling mismatch μ can be obtained by taking the Fourier transform of r_(xx)(n) and evaluating the phase corresponding to ω=π/2.

To make the implementation of (6.14) realistic, we should truncate the sequence r_(xx)(n) before taking its Fourier transform. For example, using only the four samples r_(xx)(−1), r_(xx)(0), r_(xx)(1), and r_(xx)(2), we have R _(T)(e ^(jπ/2))=[r _(xx)(0)−r _(xx)(2)]+j[r _(xx)(−1)−r _(xx)(1)].  (6.15) Using the correlator output, the μ value can be obtained by first computing R_(T)(e^(jπ/2)) according to (6.15), and then from the following: $\begin{matrix} {\mu = {\frac{2}{\pi}{{\arg\left( {R_{T}\left( {\mathbb{e}}^{{j\pi}/2} \right)} \right)}.}}} & (6.16) \end{matrix}$ For low precision requirements, this operation can be accomplished using a small CORDIC processor (Chen, A., et al., “Modified CORDIC demodulator implementation for digital IF-sampled receiver,” in Proc. Globecom 1995, vol. 2 (November 1995), pp. 1450-1454) or a ROM lookup table (Boutin, N., IEEE Trans. Consumer Electron. CE-38:5-9 (1992)). With high accuracy requirements, however, the CORDIC processor will have long delays, while the table-lookup method will certainly require a very large ROM. In this case, we propose to use the rectangular-to-polar converter which will be discussed in Section 7. This rectangular-to-polar converter requires two small ROMs and it consolidates the operations into small array-multipliers, which can yield a smaller and faster circuit using well-known efficient multiplier implementation techniques.

A synchronizer 6100 for implementing the synchronization scheme described above is illustrated in FIG. 61. The synchronizer 6100 includes a correlator 6102, a Fourier Transform module 6104, and a rectangular-to-polar converter 6106. The Fourier transform module 6104 includes various delays and adders that are known to those skilled in the arts. The rectangular-to-polar converter is described further in Section 7.

The synchronizer 6100 receives data samples associated with sampling one or more received symbols and determines an offset πμ/2, where μ represents a synchronization offset of the data samples relative to the incoming symbols. The operation of synchronizer 6100 is described in reference to the flowchart 6200, as follows.

In step 6202, a set of complex data samples is received.

In step 6204, the correlator 6102 correlates the complex data samples with a complex conjugate of a preamble data set (a_(m)*), resulting in correlated complex data samples.

In step 6206, the Fourier transform module 6104 determines the Fourier transform of the correlated data samples signal, according to equations (6.10)-(6.13) and related equations;

In step 6208, the Fourier transform module 6104 evaluates the Fourier transform of the correlated data samples at π/2, generating a complex signal representing a complex number;

In step 6210, the rectangular-to-polar converter 6106 determines an angle in a complex plane associated with the complex number of step 6210, where the angle represents synchronization between the data samples and the incoming symbols.

In step 6212, the angle from step 6210 is scaled by 2/π to determine the synchronization offset.

6.4 Bias in Symbol Timing Estimation due to Truncating the Sequence

By truncating the sequence r_(xx)(n) before taking the Fourier transform, we have produced a very simple structure to compute μ. However, since R_(T)(e^(jω)) differs from R(e^(jω)) we must determine how this difference would affect the estimated μ value. The truncated sequence r_(T)(n) is related to the original sequence r_(xx)(n) as r _(T)(n)=r _(xx)(n)w(n)  (6.17) where w(n) is a rectangular function whose Fourier transform W(e^(jω)) is a sinc function. Thus, R _(T)(e ^(jω))=R(e ^(Iω)){circle around (×)}W(e ^(jω)).  (6.18) Taking the expectation of (6.18) we have $\begin{matrix} \begin{matrix} {{E\left\lbrack {R_{T}\left( {\mathbb{e}}^{j\omega} \right)} \right\rbrack} = {E\left\lbrack {{R\left( {\mathbb{e}}^{j\omega} \right)} \otimes {W\left( {\mathbb{e}}^{j\omega} \right)}} \right\rbrack}} \\ {= {{{E\left\lbrack {R\left( {\mathbb{e}}^{j\omega} \right)} \right\rbrack} \otimes W}\left( {\mathbb{e}}^{j\omega} \right)}} \end{matrix} & (6.19) \end{matrix}$ Obviously, the μ value obtained using R_(T)(e^(jω)) in (6.16) would be different from that obtained using R(e^(jω)). This will introduce a non-zero timing-jitter mean (bias) to the μ value obtained using R_(T)(e^(jω)) instead of R(e^(jω)). But the phase difference of the expected values of R_(T)(e^(jπ/2)) and R(e^(jπ/2)) can be computed for a given g(t). The procedure is as follows:

-   1. Given the pulse waveform g(t), obtain, for each value μ, the     samples g(n−μ), n=−1, . . . , 2. -   2. Compute R_(T)(e^(jπ/2)) using these samples g(n−τ) according to     (6.15). -   3. Find the value ˆ according to (6.16). The difference between the     desired value μ and the value ˆ computed using finite samples     g(n−μ), n=−1, . . . , 2, is the bias.     This bias is illustrated in FIG. 63, where g(t) is a raised cosine     Nyquist pulse with rolloff factor α=0.1.

From FIG. 63, the bias is a function of μ and it can be precalculated and stored in a ROM in the receiver. Although the size of the ROM depends on the precision of μ, for typical precision requirements on μ the ROM can be quite small. Let us illustrate this point using an example: If an 8-bit accuracy is desired for the bias, the bias value corresponding to the three most significant bits (MSBs) in μ is indistinguishable from that corresponding to the full-precision μ value. Hence, we can use only the 3 MSBs in μ to determine the bias, thereby needing only 8 words in the bias lookup table.

Thus, for each of our symbol timing detector output samples, we can obtain the corresponding bias value from the ROM table, then subtract this bias from the original timing estimate to obtain an unbiased estimate.

We have thus far restricted our discussion to the timing recovery algorithm for θ=0. We now consider how this algorithm can be made to accommodate an arbitrary carrier phase θ.

6.5 Carrier-Independent Symbol Timing Recovery

According to (6.6), with the T_(s)=1 normalization, the complex correlator output r_(xx)(n) is dependent on θ. Although the expectation of its magnitude E[|r _(xx)(n)|]=|g(n−τ)|  (6.20) does not depend on θ, it is non-trivial to compute the magnitude of r_(xx)(n) from its real and imaginary components. Expressing r_(xx)(n) in terms of its real and imaginary components, according to (6.6), we have E[r _(xx)(n)]=g(n−μ)cos θ+jg(n−μ)sin θ.  (6.21) Thus, E[Re[r _(xx)(n)]]=g(n−μ) cos θ  (6.22) E[Im[r _(xx)(n)]]=g(n−μ)sin θ. (6.23)

Since the carrier phase θ does not depend on μ we can treat it as a constant scale factor in Re[r_(xx)(n)] and Im[r_(xx)(n)] when we are only concerned with extracting the timing information.

Clearly, therefore, instead of using the magnitude of the complex r_(xx)(n) value, we can use one of its real and imaginary parts, which are available at the output of the preamble correlator.

We, of course, must decide which of Re[r_(xx)(n)] and Im[r_(xx)(n)] to use. If the unknown phase θ is such that cos θ≈0 it is certainly desirable to use Im[r_(xx)(n)] instead of Re[r_(xx)(n)], and vise versa. But we don't know the θ value thus far. How do we decide which one to use?

From (6.22) and (6.23) we can see that the relative magnitudes of cos θ and sin θ can be obtained from the real and imaginary components of r_(xx)(n). For example, if |Re[r_(xx)(n)]|>|Im[r_(xx)(n)]| we certainly have that |cos θ|>|sin θ|, thus we should use the real part of the correlator output to find μ. Henceforth we denote the appropriate (real or imaginary) part of r_(xx)(n) by {circumflex over (r)}_(xx)(n).

6.6 Carrier Phase Computation

Next, let us examine the problem of extracting the carrier phase. From (6.6) we can see that the phase of the complex number E[r_(xx)(n)] does not depend on μ. Moreover, the carrier phase can simply be obtained by extracting the phase of r_(xx)(n). In order to achieve the best precision, it is desirable to choose the r_(xx)(n) value with the largest magnitude for carrier phase estimation. For example, if r_(xx)(n₀) is the correlator output with largest squared-magnitude, we choose r_(xx)(n₀) to compute θ=arg(r _(xx)(n ₀)).  (6.24) One advantage of this approach is that the symbol timing and carrier phase estimations are independent of each other. They can thus be carried out in parallel.

As for symbol timing estimation in (6.16), the computation in (6.24) can be accomplished efficiently using the rectangular-to-polar converter to be discussed in Section 7.

A synchronizer 6400 for determining timing and phase offsets is shown in FIG. 64. Similar to synchronizer 6100, the synchronizer 6400 receives data samples associated with sampling one or more received symbols and determines a timing offset πμ/2, where μ represents a synchronization offset between the data samples and the incoming symbols. Additionally, the synchronizer 6400 determines a carrier phase offset represented by θ. The synchronizer 6400 includes the correlator 6102, sample selectors 6404 and 6406, the Fourier transform module 6104, and two rectangular-to-polar converters 6106. The operation of synchronizer 6400 is described in reference to the flowchart 6500 in FIGS. 65A-B, as follows. The order of the steps in flowchart 6500 is not limiting, as one or more steps can be performed simultaneously or in a different order, as will be understood by those skilled in the relevant arts.

In step 6502, a set of complex data samples is received.

In step 6504, the correlator 6102 correlates the complex data samples with a complex conjugate of a preamble data set (a_(m)*), resulting in correlated complex data samples. Each correlated complex data sample includes a real sample and an imaginary sample.

In step 6506, the sample set selector 6404 selects either the set of real correlated samples or the set of imaginary correlated samples. In embodiments, the set with the larger magnitude is selected.

In step 6508, the Fourier transform module 6104 determines the Fourier transform of the selected real or imaginary data samples, according to equations (6.10)-(6.13) and related equations;

In step 6510, the Fourier transform module 6104 evaluates the Fourier transform at π/2, generating a complex signal representing a complex number;

In step 6512, the rectangular-to-polar converter 6106 a determines an angle in a complex plane associated with the complex number of step 6510, where the angle represents synchronization between the data samples and the incoming symbols.

In step 6514, the angle from step 6512 is scaled by 2/π to determine the synchronization offset.

In step 6516, the selector 6406 selects the largest correlator complex output. This selection can be based on an examination of one of the parts (real, imaginary) of the data sequence.

In step 6518, the rectangular-to-polar converter 6106 b determines an angle in a complex plane associated with complex output of step 6516, where the angle represents the carrier phase offset θ.

6.7 Simulation Result

We have used the above procedures to estimate the timing delay and the carrier phase of binary PAM symbols. The pulse shape was raised cosine with rolloff factor α=0.4. The block size was L=32 preamble symbols. To demonstrate its performance for signals with small excess bandwidth, we also tested this method with α=0.1. For a carrier phase offset θ=45°, we ran the simulation repeatedly using the synchronizer 6400, each time using a μ value randomly chosen between 0 and 1.

In addition to synchronizer 6400, we have also used the following two well-known methods to estimate the sampling mismatch:

-   1) the DFT-based square-timing recovery (Oerder M., and Meyr, H.,     IEEE Trans. Comm. 36:605-612 (1988)), -   2) the method of (Gardner, S., Electron. Eng. 71:75-83 (December     1999)) that maps r_(xx)(n₀+1)/r_(xx)(n₀)—the ratio of the two     correlation values nearest the peak (see FIG. 60)—to the sampling     mismatch value μ.

The variances of the timing jitter using these estimation methods for α=0.4 and α=0.1 are plotted in FIG. 66 and FIG. 67, respectively. The corresponding Cramer-Rao bounds (CRB)—the theoretical lower bounds of estimation errors (Meyr, H., et al., Digital Communication Receivers: Synchronization, Channel Estimation and Signal Processing, Wiley, New York, N.Y. (1998))—are also shown. We can see that, in both cases, the timing-jitter variance using the proposed synchronizer is quite close to the theoretical bound. It clearly outperforms the other two methods, even for signals employing small excess bandwidth, as seen in FIG. 67.

The variance of the phase estimation error is depicted in FIG. 68. It shows that, using the proposed method, the phase estimation error agrees quite well with the theoretical bound.

6.8 Conclusion

A synchronizer for initial symbol timing and carrier phase estimation using preambles has been presented. This synchronizer requires just two samples per symbol. Since the two estimations are independent of each other, they can be carried out simultaneously. These characteristics would ease the demand for computational speed for high-data-rate applications. Moreover, this synchronizer has demonstrated very good timing estimation performance even for signals with small excess bandwidth, which is essential for bandwidth efficient communications. The parameter estimations can be implemented very efficiently using the synchronizer 6400. Due to its simplicity, this method is attractive for applications where low power and low complexity are desired, such as in a hand-held transceiver.

7. A HIGH-SPEED PROCESSOR FOR RECTANGULAR-TO-POLAR CONVERSION

As discussed previously, the rapid acquisition characteristic of feedforward symbol synchronizers is essential to symbol synchronization for burst modems. Many feedforward structures require the evaluation of the phase of a complex number. That is, an efficient implementation of the phase extraction process is crucial. In order to handle a wide range of communications problems (Section 8), a general rectangular-to-polar conversion problem is considered.

There are several well-known implementations for a rectangular to polar coordinate conversion, i.e. obtaining the magnitude and phase of a complex number. One method uses a ROM lookup table with both the real and imaginary components as input. This is practical only for low bit-accuracy requirements, as the ROM size grows exponentially with an increasing number of input bits. To reduce the ROM size, we can first divide the imaginary by the real component, then use the quotient to index the lookup table. But the hardware for a full-speed divider is very complicated and power consuming. An iterative divider implemented using shifting and subtraction requires less hardware, but it is usually quite slow. Recently, CORDIC has been applied in this coordinate conversion (Chen, A., and Yang, S., “Reduced complexity CORDIC demodulator implementation for D-AMPS and digital IF-sampled receiver,” in Proc. Globecom 1998, vol. 3 (1998), pp. 1491-1496). However, due to the sequential nature of CORDIC, it is difficult to pipeline, thus limiting the throughput rate.

In burst-mode communication systems, rapid carrier and clock synchronization is crucial (Andronico, M., et al., “A new algorithm for fast synchronization in a burst mode PSK demodulator,” in Proc. 1995 IEEE Int. Conf. Comm., vol. 3 (June 1995), pp. 1641-1646). Therefore, a fast rectangular-to-polar conversion is desired. In this section, we present an apparatus and method that implements the angle computation for rectangular-to-polar conversion with low latency and low hardware cost. This processor and the polar-to-rectangular processor presented in Section 5 (See rotator 3900 in FIG. 39), together, can perform the M-ary PSK modulation devised in (Critchlow, D., “The design and simulation of a modulatable direct digital synthesizer with non-iterative coordinate transformation and noise shaping filter,” M.S. thesis, University of California, San Diego (1989)).

7.1 Partitioning the Angle

FIG. 69 displays a point in the Cartesian X-Y plane having coordinates

(X₀, Y₀), wherein X₀ and Y₀ represent the real and imaginary parts of an input complex signal. The angle [phi(variant)] can be computed as φ=tan⁻¹(Y ₀ /X ₀).  (7.1) In deriving the core of our algorithm, we assume the dividend and divisor satisfy X ₀ ≧Y ₀≧0.  (7.2) We will discuss how to extend the result to arbitrary values in Section 7.4. To achieve the highest precision for given hardware, the inputs X₀ and Y₀ should be scaled such that 1≦X ₀<2.  (7.3)

A straightforward method for fast implementation of (7.1) can be devised as follows:

1) Obtain the reciprocal of X₀ from a lookup table.

2) Compute Y₀×(1/X₀) with a fast multiplier.

3) Use this product to index an arctangent table for [phi(variant)].

However, the size of the two tables grows exponentially with increased precision requirements on [phi(variant)], and rather large tables would be required to achieve accurate results. Therefore, for high-precision applications, such an implementation seems impractical.

If we approximate 1/X₀ by the reciprocal of the most significant bits (MSBs) of X₀, denoted by [X₀], then the required reciprocal table is much smaller. We can then multiply the table output by Y₀ to yield Y₀/[X₀], which is an approximation of Y₀/X₀. This quotient can then be used to index an arctangent table. Similar to the reciprocal table, a much smaller arctangent table is needed if we use only the MSBs of Y₀/[X₀], denoted by [Y₀/[X₀]], to address the table, which returns [phi(variant)]₁=tan⁻¹([Y₀/[X₀]]). Obviously, this result is just an approximation to [phi(variant)]. We will subsequently refer to the computation of [phi(variant)], as the coarse computation stage.

Let [phi(variant)]₂ be the difference between [phi(variant)] and [phi(variant)]₁. Using the trigonometric identity tan[phi(variant)]₂=tan([phi(variant)]−[phi(variant)]₁)=(tan[phi(variant)]−tan[phi(variant)]₁)/(1+tan[phi(variant)]×tan[phi(variant)]₁)  (7.4) and the definitions tan[phi(variant)]=Y₀/X₀ and tan[phi(variant)], =[Y₀/[X₀]], we have $\begin{matrix} {{\tan\quad\varphi_{2}} = {\frac{{Y_{0}/X_{0}} - \left\lbrack {Y_{0}/\left\lbrack X_{0} \right\rbrack} \right\rbrack}{1 + {\left( {Y_{0}/X_{0}} \right) \times \left\lbrack {Y_{0}/\left\lbrack X_{0} \right\rbrack} \right\rbrack}} = {\frac{Y_{0} - {X_{0} \times \left\lbrack {Y_{0}/\left\lbrack X_{0} \right\rbrack} \right\rbrack}}{X_{0} + {Y_{0} \times \left\lbrack {Y_{0}/\left\lbrack X_{0} \right\rbrack} \right\rbrack}}.}}} & (7.5) \end{matrix}$

Using this relationship, [phi(variant)]₂ can be determined from [Y₀/[X₀]], the coarse computation results. Therefore, the desired result [phi(variant)] can be obtained by adding the fine correction angle [phi(variant)]₂ to the coarse approximation [phi (variant)]₁. This procedure of finding [phi(variant)]₂ will subsequently be referred to as the fine computation stage.

By partitioning the computation of (7.1) into two stages, the table size in the coarse stage can be reduced significantly at the expense of additional computations, which are handled by the fine stage. Let us now examine the complexity of the fine stage. To find [phi(variant)]₂, we can first compute X ₁ =X ₀ +Y ₀ ×[Y ₀/[X₀]] Y ₁ =Y ₀ −X ₀ ×[Y ₀/[X₀]]  (7.6) and then find [phi(variant)]₂ as φ₂=tan⁻¹(Y ₁ /X ₁).  (7.7)

The computation in (7.6) involves only adders and multipliers, while (7.7) requires lookup tables. Moreover, it seems we can't use the same coarse-stage tables because they have low resolution and thus can't satisfy the high precision requirements for the fine angle [phi(variant)]₂. Now let us analyze [phi(variant)]₂ to see if there is any property that can help in this situation.

If [phi(variant)], is a good approximation of [phi(variant)], then [phi(variant)]₂=[phi(variant)]−[phi(variant)], is close to zero. In view of (7.7), Y₁/X₁ should be very small too. This property helps us in two respects: 1) The difference between Y₁/X₁ and Y₁/[X₁] is much smaller than that between 1/X₁ and 1/[X₁]. This suggests that if we use the same low resolution reciprocal table as in the coarse stage, the error contributed to the final result will be very small. We will demonstrate this in the next section. 2) If Y₁/X₁ is sufficiently small to satisfy |Y ₁ /X ₁|=|tan φ₂|<2^(−N/3)  (7.8) where N denotes the desired number of bits in [phi(variant)], then φ₂=tan⁻¹(Y ₁ /X ₁)≈Y ₁ /X ₁  (7.9) and we can compute [phi(variant)]₂ without using an arctangent table. This is explained as follows:

From the Taylor expansion of tan⁻¹(Y₁/X₁) near Y₁/X₁=0, we obtain tan⁻¹(Y ₁ /X ₁)=Y ₁ /X ₁−(Y ₁ /X ₁)³/3+O((Y ₁ /X ₁)⁵).  (7.10) Since O((Y₁/X₁)⁵) is negligible in comparison to (Y₁/X₁)³/3, it can be omitted. Therefore, if Y₁/X₁ is used to approximate tan⁻¹(Y₁/X₁), an error Δ_(tan)=tan⁻¹(Y ₁ /X ₁)−Y ₁ /X ₁=−(Y ₁ /X ₁)³/3  (7.11) will occur. However, according to (7.8), Δ_(tan) is bounded by |Δ_(tan)|<2^(−N)/3  (7.12) which is very small. This indicates that the approximation (7.9) is quite accurate if (7.8) is satisfied.

From the above analysis, no additional tables are needed for the fine stage if [phi(variant)]₁ is sufficiently close to [phi(variant)]. On the other hand, the better that [phi(variant)]₁ approximates [phi(variant)], the larger the tables required for its computation become. As mentioned previously, table size grows exponentially as the precision increases. A good trade-off is obtained when the result [phi(variant)]₁ of the coarse stage is just close enough to [phi(variant)] that (7.8) is satisfied, thereby eliminating the additional tables in the fine stage. A detailed description of a rectangular-to-polar converter that implements the algorithm follows.

FIG. 71 illustrates a rectangular-to-polar converter 7100 that implements the coarse and fine rotation described in section 7 herein, including equation (7.1)-(7.53). The converter 7100 receives a complex input signal 7102 (that represents a complex number having X₀ and Y₀ components) and determines the angle [phi(variant)], which represents the position of the complex signal 7102 in the complex plane. In doing so, the converter 7100 determines a coarse angle computation that is represented by the angle [phi(variant)]₁, and performs a fine angle computation represented by the angle [phi(variant)]₂. Once [phi(variant)]₁ is determined, the input complex number 7102 is conceptually rotated back toward the X-axis to an intermediate complex signal 7115 as represented in FIG. 72, and [phi(variant)]₂ is determined from intermediate complex signal 7115. The angles [phi(variant)]₁ and [phi(variant)]₂ are added together to determine [phi(variant)].

The converter 7100 includes: an input mux 7104, reciprocal ROM 7106, output demux 7108, an arctan ROM 7110, a multiplier 7112, a butterfly circuit 7114, a scaling shifter 7116, a fine angle computation stage 7124, and an adder 7126. The fine angle computation includes a multiplier set 7118, a one's complementer 7120, and a multiplier 7122.

The ROM 7106 stores reciprocal values of [X₀], wherein [X₀] is defined as the most significant bits (MSB) of X₀ of the input signal 7102. The reciprocal of [X₀] is represented as Z₀, for ease of reference. As will be shown, the ROM 7106 is re-used to determine the reciprocal of [X₁], where X₁ is the real part of the intermediate complex number 7115 shown in FIG. 71 and FIG. 72. The reciprocal of [X₁] is represented as Z₁, for ease of reference. In embodiments, the ROM 7106 has 2^(N/3+1) storage spaces, where N is the number of bits that represents X₀ (and Y₀) of the input signal 7102.

The input mux 7104 chooses between [X₀] and [X₁] as an input to the reciprocal ROM 7106, according to the control 7128. The output demux 7108 couples an output of the ROM 7106 to Z₀ or Z₁ according to the control 7128.

The control 7128 assures that Z₀ receives the stored reciprocal value for [X₀], and that Z₁ receives the stored reciprocal value for [X₁].

The arctan ROM 7110 stores the coarse approximation angle [phi(variant)]₁ based on a [Y₀Z₀] input. Therefore, a coarse stage can be described as including the ROM ROM 7110, the ROM 7106, and the multiplier 7112, as they are used in the coarse angle computation.

The operation of the converter 7100 is described further with reference to the flowchart 7300, as follows. The order of the steps in the flowchart 7300 is not limiting as one or more of the steps can be performed simultaneously, or in different order.

In step 7302, the input complex signal 7102 having a X₀ component and a Y₀ component is received. In embodiments, the X₀ and Y₀ components are N-bit binary numbers.

In step 7304, the control 7128 causes Z₀ to be retrieved from the ROM

7106, where Z₀ represents 1/[X₀], and wherein [X₀] is the MSBs of X₀.

In step 7306, the multiplier 7112 multiplies Y₀ of the input complex number 7102 by Z₀, resulting in a [Z₀Y₀] component. The [Z₀Y₀] component is an approximation of Y₀/X₀.

In step 7308, the coarse angle [phi(variant)], is retrieved from the ROM 7110 based on [Z₀Y₀], and is sent to the adder 7126. Note that the coarse stage can be described as including the ROM 7110, the ROM 7106, and the multiplier 7112, as they are used in the coarse angle computation.

In step 7310, the butterfly circuit 7114 multiplies the input complex signal 7102 by [Z₀Y₀]. This causes the input complex signal 7102 to be rotated in the complex plane toward the real axis to produce the intermediate complex signal 7115 (representing an intermediate complex number), having a real X₁ component and an imaginary Y₁ component.

In step 7312, the scaler 7116 scales the X₁ component of the intermediate complex signal so that it is compatible with the reciprocal values stored in the ROM 7106. The scaler also scales the Y₁ component by the same amount.

In step 7314, the control 7128 causes Z₁ to be retrieved from the ROM 7106 based on [X₁], where Z₁ represents 1/[X₁], and wherein [X₁] is the MSBs of X₁. Note, that the ROM 7106 is efficiently used twice to calculate two different reciprocals Z₀ and Z₁, thereby reducing overall memory size.

In step 7316, the fine angle computation stage 7124 determines the fine angle [phi(variant)]₂ based on Z₁ and the scaled intermediate complex number 7115. In doing so the Newton-Raphson method is emulated in hardware to estimate [phi(variant)]₂, which is the arctan of Z₁Y₁. More specifically, multiplier set 7118 multiples X₁,Y₁ by Z₁. The ones' (approximating two's) complement 7120 is then determined for X₁Z₁. After which, the multiplier 7127 multiplies (2-X₁Z₁) by Y₁Z₁, to determine tan[phi(variant)]₂. Since [phi(variant)]₂ is a small angle, the value tan[phi(variant)]₂ is used as an approximation of [phi(variant)]₂.

In step 7316, the [phi(variant)], and [phi(variant)]₂ are added together to get [phi(variant)].

A more detailed description of the algorithm follows.

7.2 The Two-Stage Algorithm

In this section we first analyze how the coarse approximation error [phi (variant)]₂=[phi(variant)]−[phi(variant)], depends upon the precision of the tables 7106 and 7110, in order to determine the amount of hardware that must be allocated to the coarse stage. Next we explore ways to simplify the computations in the fine stage.

7.2.1 Simplification in the Coarse Computation Stage

The main concern in the coarse stage design is how the lookup table values are generated to produce as precise results as possible for a given table size. As mentioned previously, there are two lookup tables:

7.2.1.1 The Reciprocal Table 7106

The input to this table, 1≦X₀<2, can be expressed as X ₀=1·x ₁ x ₂ . . . x _(m) . . . x _(N)  (7.13) where only bits x₁ through x_(m) are used to index the table. To generate the table value, if we merely truncate X₀ as [X ₀]=1·x ₁ x ₂ . . . x_(m)  (7.14) then the quantization error Δ_(X) ₀ =X₀−[X₀] is bounded by 0<Δ_(X) ₀ <2^(−m).  (7.15) Thus, the difference between the table value and 1/X₀, 1/X ₀ −1/[X ₀]=([X ₀]−X₀)/([X ₀ ]X ₀)≈−Δ_(X) ₀ /X ₀ ²  (7.16) is bounded by −2^(−m)<1/X ₀−1/[X ₀]≦0.  (7.17) But if we generate the table value corresponding to [X ₀]=1·x ₁ x ₂ . . . x _(m)1  (7.18) with a bit “1” appended as the LSB, then the quantization error in (7.15) is centered around zero: −2^(−m−1)<Δ_(X) ₀ <2^(−m−1)  (7.19) hence, the error in the reciprocal is also centered around zero: −2^(−m−1)<1/X ₀−1/[X ₀]≦2^(−m−1).  (7.20) Comparing (7.20) to (7.17), the maximum absolute error is reduced. This is the technique introduced in (Fowler, D. L., and Smith, J. E., “An accurate high speed implementation of division by reciprocal approximation,” in Proc. 9th Symp. on Computer Arithmetic (1989), pp. 60-67).

Since the output of the table will be multiplied by Y₀, the fewer the bits in the table value, the smaller the required multiplier hardware. Let the table value Z₀ be generated by rounding 1/[X₀] to n bits: Z ₀=0·z ₂ z ₃ . . . z _(n).  (7.21) The quantization error Δ_(Z) ₀ =1/[X₀]−Z₀ is then bounded by −2^(−n−1)<Δ_(Z) ₀ <2^(−n−1).  (7.22)

Once we have obtained Z₀ from the reciprocal table, we can get an approximation to the quotient Y₀/X₀ by computing Y₀Z₀. This result is then used to address the arctangent table for [phi(variant)]₁.

7.2.1.2 The Arctangent Table 7110

In order to use a very small table, Y₀ Z₀ is rounded to k bits to the right of the radix point to become [Y₀ Z₀], with the rounding error bounded by −2^(−k−1)<Δ_(Y) ₀ _(Z) ₀ =Y ₀ Z ₀ −[Y ₀ Z ₀]<2^(−k−1).  (7.23) Then, [Y₀ Z₀] is used to index the arctangent table, which returns the coarse angle [phi(variant)]₁=tan⁻¹([Y₀ Z₀]).

Now we must determine the minimum m, n and k values such that (7.8) is satisfied. First, let us examine X₁ and Y₁ which are computed using [Y₀ Z₀] as X ₁ =X ₀ +Y ₀ [Y ₀ Z _(0])  (7.24) Y ₁ =Y ₀ −X ₀ [Y ₀ Z ₀].  (7.25)

Dividing (7.25) by (7.24), and then dividing both the numerator and denominator by X₀, we have $\begin{matrix} {{{Y_{1}/X_{1}}} = {{{\left( {{Y_{0}/X_{0}} - \left\lbrack {Y_{0}Z_{0}} \right\rbrack} \right)/\left( {1 + {\left( {Y_{0}/X_{0}} \right)\left\lbrack {Y_{0}Z_{0}} \right\rbrack}} \right)}} \leq {{{{Y_{0}/X_{0}} - \left\lbrack {Y_{0}Z_{0}} \right\rbrack}}.}}} & (7.26) \end{matrix}$ The inequality is true because X₀≧Y₀≧0 and [Y₀Z₀]≧0. Taking into account all the quantization errors in (7.20), (7.22) and (7.23), we can express Y₀/X₀ in terms of [Y₀ Z₀] as $\begin{matrix} \begin{matrix} {{Y_{0}\left( {1/X_{0}} \right)} \approx {Y_{0}\left( {{1/\left\lbrack X_{0} \right\rbrack} - {\Delta_{X_{0}}/X_{0}^{2}}} \right)}} \\ {= {Y_{0}\left( {\left( {Z_{0} + \Delta_{Z_{0}}} \right) - {\Delta_{X_{0}}/X_{0}^{2}}} \right)}} \\ {= {{Y_{0}Z_{0}} + {Y_{0}\Delta_{Z_{0}}} - {Y_{0}\left( {\Delta_{X_{0}}/X_{0}^{2}} \right)}}} \\ {= {\left\lbrack {Y_{0}Z_{0}} \right\rbrack + \Delta_{Y_{0}Z_{0}} + {Y_{0}\Delta_{Z_{0}}} - {{Y_{0}\left( {\Delta_{X_{0}}/X_{0}^{2}} \right)}.}}} \end{matrix} & (7.27) \end{matrix}$ Substituting this result into (7.26), we have |Y ₁ /X ₁|≦|Δ_(Y) ₀ _(Z) ₀ +Y ₀Δ_(Z) ₀ −Y ₀(Δ_(X) ₀ /X ₀ ²)|.  (7.28) Since Y₀(Δ_(X) ₀ /X₀ ²)=(Y₀/X₀)(Δ_(X) ₀ /X₀), from (7.2) and (7.19), −2^(−m−1) <Y ₀(Δ_(X) ₀ /X ₀ ²)<2^(−m−1).  (7.29) Also, according to (7.2) and (7.22), we have −2^(−n) <Y ₀Δ_(Z) ₀ <2^(−n).  (7.30) Applying (7.23), (7.29) and (7.30) to (7.28), we obtain |Y₁/X₁|<2^(−m−1)+2^(−n)+2^(−k−1). If we choose m≧N/3+1, n≧N/3+2 and k≧N/3+1, then |Y₁/X₁|<0.75×2^(−N/3)  (7.31) Therefore, since the inputs X₁ and Y₁ to the fine stage satisfy (7.8), no additional tables are needed for the fine stage. Henceforth we choose m=N/3+1, n=N/3+2 and k=N/3+1.

7.2.2 Hardware Reduction in the Fine Computation Stage 7124

Since (7.8) is satisfied, we can obtain the fine angle (2 by computing the quotient Y₁/X₁. From (7.24), we have X₀≦X₁≦X₀+Y₀, hence 1≦X₁<4. In order to use the same reciprocal table as in the coarse stage, X₁ should be scaled such that 1≦X₁<2.  (7.32) This can be satisfied by shifting X₁ to the right if X₁≧2. Of course Y₁ should also be shifted accordingly so that Y₁/X₁ remains unchanged.

As in the coarse stage, the reciprocal table accepts N/3+1 MSBs of X₁ and returns Z₁. We define the reciprocal error δ₁=1/X₁−Z₁. Since the same reciprocal table is used as in the coarse stage, δ₁ and δ₀ must have the same bound. Since δ₁=δ₀=1/X ₀ −Z ₀=1/X ₀−1/[X ₀]+Δ_(Z) ₀   (7.33) we can use (7.20) and (7.22) to obtain −0.75×2^(−N/3−1)<δ₁<0.75×2^(−N/3−1).  (7.34) The bound on Y₁ can be found using (7.31) and (7.32): |Y ₁|<0.75×2^(−N/3+1).  (7.35) Now we can obtain the final error bound in approximating X₁/Y₁ by Y₁Z₁, according to (7.34) and (7.35), as |Y ₁ /X ₁ −Y ₁ X ₁ |=|Y ₁δ₁|<(0.75)²×2^(−2N/3).  (7.36)

Clearly, this approximation error is too large. To reduce the maximum error below 2^(−N), the bound on |δ₁| should be approximately 2^(−2N/3), which would require the reciprocal table to accept 2N/3 bits as input. That is, the table needed for such a high-resolution input would be significantly larger than the one already employed by the coarse stage.

To overcome this difficulty, we can apply the Newton-Raphson iteration method (Koren, I., Computer Arithmetic Algorithms, Prentice Hall, Englewood Cliffs, N.J. (1993)) to reduce the initial approximation error δ₁. We now briefly explain how this method works. First, let us define the following function: f(Z)=1/Z−X ₁.  (7.37) Obviously, we can obtain Z=1/X₁ by solving f(Z)=0. In other words, we can find 1/X₁ by searching for the Z value such that f(Z) intersects the Z-axis, as shown in FIG. 70A.

Shifting the Z-axis down by X₁, we obtain a new function ${{f_{1}(Z)} = \frac{1}{\quad Z}},$ shown in FIG. 70B. At Z₁=1/[X₁], Z₁ being the initial guess, the slope of f₁(Z)=1/Z is $\begin{matrix} {{f_{1}^{\prime}\left( Z_{1} \right)} = {- {\frac{1}{Z_{1}^{2}}.}}} & (7.38) \end{matrix}$ The tangent, shown as the dashed line 7102, intersects the f₁(Z)=X₁ line at a new point Z₂. From FIG. 70B, Z₂ is much closer to the desired value 1/X₁ than the initial guess Z₁. Let us now find Z₂. According to FIG. 7-3, we must have $\begin{matrix} {\frac{X_{1} - {1/Z_{1}}}{Z_{2} - Z_{1}} = {- {\frac{1}{Z_{1}^{2}}.}}} & (7.39) \end{matrix}$ Expressing Z₂ in terms of Z₁ and X₁ we have Z ₂=Z₁(2−₁ Z ₁).  (7.40) Thus, we can obtain Z₂, a more accurate approximation of 1/X₁, from Z₁. One may wonder how accurate Z₂ is in approximating 1/X₁. Let us now examine the approximation error bound.

Substituting Z₁=1/X₁−δ₁ into (7.40), we have $\begin{matrix} \begin{matrix} {Z_{2} = {\left( {{1/X_{1}} - \delta_{1}} \right)\left( {2 - {X_{1}\left( {{1/X_{1}} - \delta_{1}} \right)}} \right)}} \\ {= {{1/X_{1}} - {X_{1}{\delta_{1}^{2}.}}}} \end{matrix} & (7.41) \end{matrix}$ According to (7.32), (7.34) and (7.35), after one Newton-Raphson iteration, the error in Y₁Z₂ is reduced to |Y₁ /X ₁ −Y ₁ Z ₂ |=|Y ₁ X ₁δ₁ ²|<(0.75)³×2^(−N).  (7.42) Thus, a rather accurate result is obtained with just one iteration.

Finally, the fine angle can be computed by multiplying Z₂ by Y₁: φ₂ ≈Y ₁ Z ₂ =Y ₁ Z ₁(2−X ₁ Z ₁).  (7.43)

Although there are three multipliers involved in (7.43), the size of these multipliers can be reduced with just a slight accuracy loss by truncating the data before feeding them to the multipliers. The computational procedure of (7.43) is as follows:

1) The inputs to the fine stage, X₁ and Y₁, are truncated to 2N/3+2 and N+3 bits to the right of their radix points, respectively. Since the N/3−1 MSBs in Y₁ are just sign bits, as indicated by (7.35), they do not influence the complexity of the multiplier that produces Y₁Z₁. The corresponding quantization errors are bounded by 0≦Δ_(X) ₁ <2^(−2N/3−2)  (7.44) 0≦Δ_(Y) ₁ <2^(−N−3)  (7.45)

2) Both quantized X₁ and Y₁ are multiplied by Z₁.

3) To form 2-X₁Z₁, instead of generating the two's complement of X₁Z₁, we can use the ones complement with only an insignificant error. Since this error is much smaller, in comparison to the truncation error in the next step, we can neglect it.

4) The product Y₁Z₁ is truncated to N+3 bits. We would also truncate the ones complement of X₁Z₁. But since the inverted LSBs of X₁Z₁ will be discarded, we can truncate X₁Z₁ to 2N/3+2 bits and then take its ones vcomplement. The corresponding quantization errors, as discussed above, are: 0≦Δ_(X) ₁ _(Z) ₁ <2^(−2N/3−2)  (7.46) 0≦Δ_(Y) ₁ _(Z) ₁ <2^(−N−3)

After including all the error sources due to simplification, we now analyze the effects of these errors on the final result [phi(variant)]₂. Taking the errors into account, we can rewrite (7.43) as: φ₂≈((Y ₁−Δ_(Y) ₁ )(1/X ₁ −δ ₁)+Δ_(Y) ₁ _(Z) ₁ )(2−(X ₁ −Δ _(X) ₁ )(1/X ₁−δ₁)+Δ_(X) ₁ _(Z) ₁ )  (7.48) Expanding this product and neglecting terms whose magnitudes are insignificant, we have φ₂ ≈Y ₁ /X ₁ −Y ₁ X ₁δ₁ ²+(Y ₁ /X ₁ ²)Δ_(X) ₁ −(1/X ₁)Δ_(Y) ₁ +(Y ₁ /X ₁)(Δ_(X) ₁ _(Z) ₁ )+Δ_(Y) ₁ _(Z) ₁ .  (7.49)

As mentioned in Section 7.1, Y₁/X₁ is an approximation of tan⁻¹(Y₁/X₁). Its approximation error, defined in (7.8), is bounded by |Δ_(tan)|=|(Y ₁ /X ₁)³/3|<(0.75)³×2^(−N)/3.  (7.50) Replacing Y₁/X₁ by tan⁻¹ (Y₁/X₁)+(Y₁/X₁)³/3 in (7.49), we have φ₂≈tan⁻¹(Y ₁ /X ₁)+(Y ₁ /X ₁)³/3−Y ₁ X ₁δ₁ ²+(Y ₁ /X ₁ ²)Δ_(X) ₁ −(1/X ₁)Δ_(Y) ₁ +(Y ₁ /X ₁)ΔX₁ Z ₁+Δ_(Y) ₁ _(Z) ₁ .  (7.51) The total error, ε=[phi(variant)]₂−tan⁻¹(Y₁/X₁), is ε=(Y ₁ /X ₁){(Y ₁ /X ₁)²/3−(X ₁ ,δ ₁)²+Δ_(X) ₁ /X ₁+Δ_(X) ₁ _(Z) ₁ }−(1/X ₁)Δ_(Y) ₁ +ΔY ₁ _(Z) ₁ .  (7.52) All terms in the subtotal (Y₁/X₁)²/3−(X₁δ₁)²+Δ_(X) ₁ /X₁+Δ_(X) ₁ _(Z) ₁ are non-negative. Thus, the lower bound of this subtotal is the minimum value of −(X₁δ₁)², which is −0.75²×2^(−2N/3)=−0.56×2^(−2N/3), according to (7.34). Correspondingly, its upper bound is the sum of the maximum values of the other three terms: (0.75²/3+2⁻²+2⁻²)×2^(−2N/3)=0.68×2^(−2N/3).

Finally, we can obtain the total error bound as: |ε|<0.75×2^(−N/3)×0.68×2^(−2N/3)+2^(−N−3)+2^(−N−3)=0.76×2^(−N).  (7.53) 7.3 Magnitude Calculation

Once the angle of the vector (X₀,Y₀) is known, its magnitude can be obtained by multiplying X₀ by 1/cos [phi(variant)], whose values can be pre-calculated and stored in a ROM, thereby requiring only a single multiplication. However, if we use all the available bits to index the ROM table, it is likely that a very large ROM will be needed.

As we know from the preceding discussion, the coarse angle [phi(variant)], is an approximation of [phi(variant)]. Similarly 1/cos [phi(variant)], approximates 1/cos [phi(variant)]. Therefore, we can expand the coarse-stage ROM 7110 to include also the 1/cos [phi(variant)], values. That is, for each input [Y₀Z₀], the coarse-stage ROM would output both [phi(variant)]₁ 32 tan⁻¹([Y₀Z₀]) and 1/cos [phi(variant)]₁. Since X₀ and Y₀ satisfy (7.2) and (7.3), the 1/cos [phi(variant)] value is within the interval [1,√{square root over (2)}].

For many applications, the magnitude value is used only to adjust the scaling of some signal level, and high precision is not necessary. For applications where a higher precision is desired, we propose the following approach:

First, instead of using the above-mentioned table of 1/cos [phi(variant)]₁ values, we pre-calculate and store in ROM the 1/cos [phi(variant)]_(M) values, where [phi(variant)]_(M) contains only the m MSBs of [phi(variant)]. Obviously a small table, one of comparable size to the 1/cos[phi(variant)]₁ table, is needed. Then, we can look up the table entries for the two nearest values to [phi(variant)], namely [phi(variant)]_(M) and φ′_(M)=φ_(M)+2^(−m). Then a better approximation of 1/cos [phi(variant)] can be obtained by interpolating between the table values 1/cos [phi(variant)]_(M) and 1/cos φ′_(M) as $\begin{matrix} {{{1/\cos}\quad\varphi} = {{1\quad\cos\quad\varphi_{M}} + {\frac{{{1/\cos}\quad\varphi_{M}^{\prime}} - {1\cos\quad\varphi_{M}}}{\varphi_{M}^{\prime} - \varphi_{M}} \times {\left( {\varphi - \varphi_{M}} \right).}}}} & (7.54) \end{matrix}$ Let [phi(variant)]_(L)=[phi(variant)]−[phi(variant)]_(M). Obviously, [phi(variant)]_(L) simply contains the LSBs of [phi(variant)]. We can now rewrite (7.54) as 1 cos φ≈1/cos φ_(M)+(1/cos φ′_(M)−1/cos φ_(M))×φ_(L)×2^(m)  (7.55) which involves only a multiplication and a shift operation, in addition to two adders. 7.4 Converting Arbitrary Inputs

In previous sections we have restricted the input values to lie within the bounds of (7.2) and (7.3). However, if the coordinates of (X₀,Y₀) do not satisfy that condition, we must map the given point to one whose coordinates do. Of course, the resulting angle must be modified accordingly. To do that, we replace X₀ and Y₀ by their absolute values. This maps (X₀,Y₀) into the first quadrant. Next, the larger of |X₀| and |Y₀| is used as the denominator in (7.1) and the other as the numerator. This places the corresponding angle in the interval [0, π/4]. We can now use the procedure discussed previously to obtain [phi(variant)]. Once we get [phi(variant)], we can find the angle φ that corresponds to the original coordinates from [phi(variant)]. First, if originally |X₀|<|Y₀| we should map [phi(variant)] to [π/4, π/2] using φ′=π/2−φ. Otherwise φ′=φ. We then map this result to the original quadrant according to Table 7.1.

Next, let us examine the affect of the above-mentioned mapping on the magnitude calculation. Since the negation and exchange of the original X₀ and Y₀ values do not change the magnitude, whose value is (X₀ ²+Y₀ ²)^(1/2), the result obtained using the X₀ and Y₀ values after the mapping needs no correction. However, if the input values were scaled to satisfy (7.3), we then need to scale the computed magnitude to the original scale of X₀ and Y₀. TABLE 7.1 Converting Arbitrary Inputs Original coordinates Modification to the angle X₀ < 0, Y₀ > 0 φ = π − φ′ X₀ < 0, Y₀ < 0 φ = π + φ′ X₀ > 0, Y₀ < 0 φ = 2π − φ′ 7.5 Test Result

We have verified our error bound estimation by a bit-level simulation of the rectangular-to-polar converter 7100. To test the core algorithm described in Section 7.2, we generated the pair of inputs X₀ and Y₀ randomly within the range described by (7.2) and (7.3). This test was run repeatedly over many different values of X₀ and Y₀, and the maximum error value was recorded. Choosing N=9 for this simulation, the error bound estimate according to (7.53) is 0.0015. Our test results yielded the error bounds [−0.00014, 0.00051], well within the calculated bound.

7.6 Conclusion

An efficient rectangular-to-polar converter is described. The angle computation of a complex number is partitioned into coarse and fine computational stages. Very small arctangent and reciprocal tables are used to obtain a coarse angle. These tables should provide just enough precision such that the remaining fine angle is small enough to approximately equal its tangent value. Therefore the fine angle can be obtained without a look-up table. The computations are consolidated into a few small multipliers, given a precision requirement. While a low-precision magnitude can be obtained quite simply, a high-precision result can be achieved by combining the angle computation with the angle rotation processor 3900 of Section 5.

The applications of this converter include the implementation of the converter 6106 in the symbol synchronizer 6100 and the synchronizer 6400. However, the converter is not limited to symbol synchronization. It also provides efficient implementation of computational tasks for many communication systems, such as constant-amplitude FSK and PSK modems (Chen, A., and Yang, S., “Reduced complexity CORDIC demodulator implementation for D-AMPS and digital IF-sampled receiver,” in Proc. Globecom 1998, vol. 3 (1998), pp. 1491-1496; Boutin, N., IEEE Trans. Consumer Electron. 38:5-9 (1992)), DMT modems (Arivoli, T., et al., “A single chip DMT modem for high-speed WLANs,” in Proc. 1998 Custom Integrated Circuits Conf. (May 1998), pp. 9-11), as well as carrier synchronization (Andronico, M., et al., “A new algorithm for fast synchronization in a burst mode PSK demodulator,” in Proc. 1995 IEEE Int. Conf Comm., vol. 3 (June 1995), pp. 1641-1646; Fitz, M. P., and Lindsey, W. C., IEEE Trans. Comm. 40:1644-1653 (1992) where the computation of phase and magnitude from the rectangular coordinates is essential.

8. EXEMPLARY COMPUTER SYSTEM

Embodiments of invention may be implemented using hardware, software or a combination thereof and may be implemented in a computer system or other processing system. In fact, in one embodiment, the invention is directed toward a software and/or hardware embodiment in a computer system. An example computer system 7702 is shown in FIG. 77. The computer system 7702 includes one or more processors, such as processor 7704. The processor 7704 is connected to a communication bus 7706. The invention can be implemented in various software embodiments that can operate in this example computer system. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computer systems and/or computer architectures.

Computer system 7702 also includes a main memory 7708, preferably a random access memory (RAM), and can also include a secondary memory or secondary storage 7710. The secondary memory 7710 can include, for example, a hard disk drive 7712 and a removable storage drive 7714, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive 7714 reads from and/or writes to a removable storage unit 7716 in a well known manner. Removable storage unit 7716, represents a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive 7714. As will be appreciated, the removable storage unit 7716 includes a computer usable storage medium having stored therein computer software and/or data.

In alternative embodiments, secondary memory 7710 may include other similar means for allowing computer software and data to be loaded into computer system 7702. Such means can include, for example, a removable storage unit 7720 and an storage interface 7718. Examples of such can include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 7720 and interfaces 7718 which allow software and data to be transferred from the removable storage unit 7720 to the computer system 7702.

Computer system 7702 can also include a communications interface 7722. Communications interface 7722 allows software and data to be transferred between computer system 7702 and external devices 7726. Examples of communications interface 7722 can include a modem, a network interface (such as an Ethernet card), a communications port, a PCMCIA slot and card, etc. Software and data transferred via communications interface 7722 are in the form of signals, which can be electronic, electromagnetic, optical or other signals capable of being received by the communications interface 7722. These signals are provided to the communications interface 7722 via a channel 7724. This channel 7724 can be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link and other communications channels.

Computer system 7702 may also include well known peripherals 7703 including a display monitor, a keyboard, a printers and facsimile, and a pointing device such a computer mouse, track ball, etc.

In this document, the terms “computer program medium” and “computer usable medium” are used to generally refer to media such as the removable storage devices 7716 and 7718, a hard disk installed in hard disk drive 7712, semiconductor memory devices including RAM and ROM, and associated signals. These computer program products are means for providing software (including computer programs that embody the invention) and/or data to computer system 7702.

Computer programs (also called computer control logic or computer program logic) are generally stored in main memory 7708 and/or secondary memory 7710 and executed therefrom. Computer programs can also be received via communications interface 7722. Such computer programs, when executed, enable the computer system 7702 to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 7704 to perform the features of the present invention. Accordingly, such computer programs represent controllers of the computer system 7702.

In an embodiment where the invention is implemented using software, the software may be stored in a computer program product and loaded into computer system 7702 using removable storage drive 7714, hard drive 7712 or communications interface 7722. The control logic (software), when executed by the processor 7704, causes the processor 7704 to perform the functions of the invention as described herein.

In another embodiment, the invention is implemented primarily in hardware using, for example, hardware components such as application specific integrated circuits (ASICs), stand alone processors, and/or digital signal processors (DSPs). Implementation of the hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s). In embodiments, the invention can exist as software operating on these hardware platforms.

In yet another embodiment, the invention is implemented using a combination of both hardware and software.

9. APPENDICES

The following Appendices are included.

9.1 Appendix A: Proof of the Zero ISI Condition.

In Section 3.4 we have examined the condition for a real-valued function f(t) to have zero crossings at integer multiples of the sampling period, i.e., for satisfying (3.16). We have stated that f(t) satisfies (3.16) if and only if {circumflex over (F)}(k), defined as samples of F(Ω) in (3.8) (F is the frequency response of f), satisfy (3.18). Here, −∞<k<∞ is an integer. We now provide the proof. Proof First let us define a periodic, of period N, extension of f(t) as $\begin{matrix} {{f_{c}(t)} = {\sum\limits_{n = {- \infty}}^{\infty}{{f\left( {t - {Nn}} \right)}.}}} & \left( {A{.1}} \right) \end{matrix}$ Its Fourier transform consists of a sequence of impulses $\begin{matrix} {{F_{c}(\Omega)} = {\sum\limits_{k = {- \infty}}^{\infty}{{\hat{F}(k)}{{\delta\left( {\Omega - {\frac{2\pi}{N}k}} \right)}.}}}} & \left( {A{.2}} \right) \end{matrix}$ Next, consider an impulse chain $\begin{matrix} {{c(t)} = {\sum\limits_{n = {- \infty}}^{\infty}{{\delta\left( {t - n} \right)}.}}} & \left( {A{.3}} \right) \end{matrix}$ whose Fourier transform is $\begin{matrix} {{C(\Omega)} = {\sum\limits_{k = {- \infty}}^{\infty}{{\delta\left( {\Omega - {2\quad\pi\quad k}} \right)}.}}} & \left( {A{.4}} \right) \end{matrix}$ The convolution F_(c){circle around (×)}C can be expressed as $\begin{matrix} \begin{matrix} {{{F_{c}(\Omega)} \otimes {C(\Omega)}} = {{F_{c}(\Omega)} \otimes {\sum\limits_{m = {- \infty}}^{\infty}{\delta\left( {\Omega - {2\quad\pi\quad m}} \right)}}}} \\ {= {\sum\limits_{m = {- \infty}}^{\infty}{F_{c}\left( {\Omega - {2\quad\pi\quad m}} \right)}}} \end{matrix} & \left( {A{.5}} \right) \end{matrix}$ Substituting (A.2) into (A.5) yields: $\begin{matrix} \begin{matrix} {{{F_{c}(\Omega)} \otimes {C(\Omega)}} = {\sum\limits_{m = {- \infty}}^{\infty}\left( {\sum\limits_{k = {- \infty}}^{\infty}{{\hat{F}(k)}{\delta\left( {\Omega - {2\pi\quad m} - {\frac{2\pi}{N}k}} \right)}}} \right)}} \\ {= {\sum\limits_{k = {- \infty}}^{\infty}{\sum\limits_{m = {- \infty}}^{\infty}{{\hat{F}(k)}{\delta\left( {\Omega - {\frac{2\pi}{N}\left( {k + {Nm}} \right)}} \right)}}}}} \\ {= {\sum\limits_{k = {- \infty}}^{\infty}{\left( {\sum\limits_{m = {- \infty}}^{\infty}{\hat{F}\left( {k - {Nm}} \right)}} \right){{\delta\left( {\Omega - {\frac{2\pi}{N}k}} \right)}.}}}} \end{matrix} & \left( {A{.6}} \right) \end{matrix}$ Therefore, we have the following relationships $\begin{matrix} (3.16) & \Leftrightarrow & {{f_{c}(t)} = \left\{ \begin{matrix} 1 & {{t = {Nm}},{m\quad{an}\quad{integer}}} \\ 0 & {{all}\quad{other}\quad{{integers}.}} \end{matrix} \right.} \\ \quad & \Leftrightarrow & {{{f_{c}(t)}{c(t)}} = {\sum\limits_{m = {- \infty}}^{\infty}{\delta\left( {t - {Nm}} \right)}}} \\ \quad & \Leftrightarrow & {{{F_{c}(\Omega)} \otimes {C(\Omega)}} = {\sum\limits_{k = {- \infty}}^{\infty}{\delta\left( {\Omega - {\frac{2\pi}{N}k}} \right)}}} \\ \left( {A{.6}} \right) & \Leftrightarrow & {{\sum\limits_{k = {- \infty}}^{\infty}{\left( {\sum\limits_{m = {- \infty}}^{\infty}{\hat{F}\left( {k - {Nm}} \right)}} \right){\delta\left( {\Omega - {\frac{2\pi}{N}k}} \right)}}} = {\sum\limits_{k = {- \infty}}^{\infty}{\delta\left( {\Omega - {\frac{2\pi}{N}k}} \right)}}} \\ \quad & \Leftrightarrow & {{\sum\limits_{m = {- \infty}}^{\infty}{\hat{F}\left( {k - {Nm}} \right)}} = 1} \\ \quad & \Leftrightarrow & (3.18) \end{matrix}$ This concludes the proof. 9.2 Appendix B: Impulse Response of the Simplified Interpolators

In Section 2, after introducing a preliminary interpolation method, we have shown that we can trade one angle rotator for a multiplier by conceptually modifying the input samples, then by “correcting” the interpolated value obtained from the “modified” samples. A simpler implementation structure as well as better performance in interpolating most practical signals have been facilitated. We now derive the impulse response of this interpolation filter. As discussed in Section 2, the interpolated sample is computed as $\begin{matrix} {{y(\mu)} = {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{c_{k}W_{N}^{{- k}\quad\mu}}}} - {K\quad\mu}}} & \left( {B{.1}} \right) \end{matrix}$ where K is defined in (2.30), and $\begin{matrix} {c_{k} = {{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{\overset{\sim}{y}(m)}W_{{\lbrack m\rbrack}\underset{\_}{N}}^{k\quad m}}} = {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {{y(m)} + {mK}} \right)W_{N}^{k\quad m}}}}} & \left( {B{.2}} \right) \end{matrix}$ where k=0, . . . , N/2−1. Substituting (2.30) into (B.2), we have $\begin{matrix} \begin{matrix} {c_{k} = {{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}W_{N}^{k\quad m}}} - {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {m\quad\frac{2}{N}{\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{\left( {- 1} \right)^{n}{y(n)}}}} \right)W_{N}^{k\quad m}}}}} \\ {= {{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}W_{N}^{k\quad m}}} - {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{m\quad\frac{2}{N}W_{N}^{k\quad m}}} \right)\left( {- 1} \right)^{n}{y(n)}}}}} \\ {= {{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}W_{N}^{k\quad m}}} - {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{n\quad\frac{2}{N}W_{N}^{k\quad n}}} \right)\left( {- 1} \right)^{m}{y(m)}}}}} \end{matrix} & \left( {B{.3}} \right) \end{matrix}$ Replacing K and c_(k) in (B.1) by (2.30) and (B.3), respectively, we have $\begin{matrix} \begin{matrix} {{y(\mu)} = {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {W_{N}^{k\quad m} - {\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{n\quad\frac{2}{N}{W_{N}^{k\quad n}\left( {- 1} \right)}^{m}}}} \right){y(m)}W_{N}^{{- k}\quad\mu}}}}} +}} \\ {\frac{2}{N}{\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{\left( {- 1} \right)^{m}{y(m)}\mu}}} \\ {= {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}\begin{pmatrix} {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{\quad{{N/2} - 1}}W_{N}^{k{({m - \mu})}}}} -} \\ {\frac{2}{N}\left( {- 1} \right)^{m}\left( {{\sum\limits_{n = {{{- N}/2} + 1}}^{N/2}{\frac{n}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}W_{N}^{k{({n - \mu})}}}}} - \mu} \right)} \end{pmatrix}}}} \\ {= {\sum\limits_{m = {{{- N}/2} + 1}}^{N/2}{{y(m)}{{f\left( {\mu - m} \right)}.}}}} \end{matrix} & \left( {B{.4}} \right) \end{matrix}$ where f(t), the impulse response of the simplified interpolation filter discussed in Section 2.6.1, is now defined as $\begin{matrix} {{f(t)} = {{\frac{1}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}W_{N}^{- {kt}}}} - {\frac{2}{N}\left( {- 1} \right)^{m}\left( {{\sum\limits_{n = {{{- N}/2} + 1}}^{{N/2} - 1}{\frac{n}{N}{\sum\limits_{k = {{{- N}/2} + 1}}^{{N/2} - 1}W_{N}^{k{({n - t - m})}}}}} - \left( {t + m} \right)} \right)}}} & \left( {B{.5}} \right) \end{matrix}$ for −m≦t≦1−m, m=−N/2+1, . . . ,N/2. Otherwise, f(t)=0.

The frequency response, of course, can be obtained by taking the Fourier transform of f(t). To modify the frequency response of f(t), we can multiply the c_(k) coefficient in (B.3) by a value denoted by {circumflex over (F)}μ(k). In designing an optimal interpolation filter as discussed in Section 4, we search for the {circumflex over (F)}μ(k) value that minimizes (4.4), i.e., F_(μ)(ω) most accurately approximates the desired response (4.3).

9.3 Appendix C: Fourier Transform of g(nT_(s)−μ)

Since, in Section 6, the g(nT_(s)) are samples of the continuous-time pulse g(t), assuming, without loss of generality, that T_(S)=1, it is well-known (Freeman, H., Discrete-Time Systems, Wiley, New York, N.Y. (1965)) that the Fourier transforms are related as $\begin{matrix} {{G\left( {\mathbb{e}}^{j\omega} \right)} = {\sum\limits_{k = {- \infty}}^{\infty}{\hat{G}\left( {\omega + {2\pi\quad k}} \right)}}} & \left( {C{.1}} \right) \end{matrix}$ where G(e^(jω)) and Ĝ(ω) are the Fourier transforms of g(n) and g(t), respectively. Since g(t) is bandlimited, i.e., |Ĝ(ω)|=0 for |ω|>π, we have G(e ^(jω))=Ĝ(ω), −π≦ω≦π.  (C.2) Using the Fourier transform's time-shifting property, the Fourier transform of g(t−μ) is e ^(jωμ) Ĝ(ω)  (C.3) Since the g(n−μ) are samples of g(t−μ), for the same reason as the above, their Fourier transforms are the same in the interval −π≦ω≦π, as in (C.2). Thus, according to (C.2) and (C.3) we have FT(g(n−μ))=e ^(jωμ) G(e ^(jω)), −π≦ω≦π.  (C.4) 9.4 Appendix D: Interpolation on Non-Center Intervals

When we first discussed the interpolation problem in Section 2, we focused on interpolating between the two samples in the middle of the set of samples used to generate a synchronized sample. What is the impact on interpolation performance when we interpolate in an interval not at the center of the samples being used? FIG. 74 shows such an example for N=4, where the interpolation is performed between y(0) and y(1) using y(−2), y(−1), y(0) and y(1) (as opposed to using y(−1), y(0), y(1) and y(2), as seen in FIG. 2-1).

Using the procedure described in Section 2, given N samples y(n), n=−N+2, . . . , 1, we first compute the Fourier coefficients as $\begin{matrix} {{c_{k} = {\sum\limits_{n = {{- N} + 2}}^{1}{{y(i)}W_{N}^{kn}}}},\quad{k = {{- \frac{N}{2}} + 1}},\ldots\quad,{\frac{N}{2}.}} & \left( {D{.1}} \right) \end{matrix}$ Comparing (D.1) to (2.9), their only difference is the range of the summation. As in Section 2, for a given offset 0≦μ<1, the synchronized sample y(μ) can be computed as: $\begin{matrix} {{y(\mu)} = {\frac{1}{N}{{{Re}\left( {c_{0} + {2{\sum\limits_{k = 1}^{{N/2} - 1}{c_{k}W_{N}^{{- k}\quad\mu}}}} + {c_{N/2}{\mathbb{e}}^{j\pi\mu}}} \right)}.}}} & \left( {D{.2}} \right) \end{matrix}$ We can express y(μ) in terms of y(n) by substituting (D.2) into (D.1), as $\begin{matrix} {{c_{k} = {\sum\limits_{n = {{- N} + 2}}^{1}{{y(i)}W_{N}^{kn}}}},{k = {{- \frac{N}{2}} + 1}},\ldots\quad,{\frac{N}{2}.}} & \left( {D{.1}} \right) \end{matrix}$ is the impulse response of the corresponding interpolation filter. For N=4, f(t) is plotted in FIG. 75A. Taking the Fourier transform of f(t), we obtain the corresponding frequency response, which is shown in FIG. 76A.

Comparing the FIG. 76A frequency response to FIG. 7A, both for N=4, we can see that the interpolation performance degraded significantly, as shown by the ripples in the passband and large sidelobes in the stopband in FIG. 76A, when the interpolation is not done in the center interval.

However, using the optimization method discussed in Section 4, we can “reshape” the impulse response f(t) such that the corresponding frequency response is a better approximation to the ideal interpolation frequency response.

The impulse response of an optimized interpolation filter for a non-center interval is illustrated in FIG. 75B. The corresponding frequency response is shown in FIG. 76B, which is clearly better than FIG. 76A, since it has less ripple in the passband and more attenuation in the stopband.

Using samples y(−N+2), . . . , y(−1), and y(0), to interpolate obviously reduces the latency in generating synchronized samples, as compared to using samples y(−N/2+1), . . . , y(0), . . . , y(N/2), since the interpolator does not have to wait until samples y(1), y(N/2), become available. In applications where low latency takes a higher priority than interpolation accuracy, this approach will be useful.

9.5 Appendix E

The following documents are incorporated by reference in their entireties:

-   1. Buchanan, K., et al., IEEE Pers. Comm. 4:8-13 (1997); -   2. Reimers, U., IEEE Comm. Magazine 36:104-110 (1998); -   3. Cho, K., “A frequency-agile single-chip QAM modulator with     beamforming diversity,” Ph.D. dissertation, University of     California, Los Angeles (1999); -   4. Oerder M., and Meyr, H., IEEE Trans. Comm. 36:605-612 (1988); -   5. Pollet T., and Peeters, M., IEEE Comm. Magazine 37:80-86 (1999); -   6. Gardner, F. M., IEEE Trans. Comm. 41:502-508 (1993); -   7. Erup, L., et al., IEEE Trans. Comm. 41:998-1008 (1993);

8. Farrow, C., “A continuously variable digital delay element,” in Proc. IEEE Int. Symp. Circuits Syst. (June 1988), pp. 2641-2645;

-   9. Proakis, J. G., Digital Communications, McGraw-Hill, New York,     N.Y. (1993); -   10. Proakis, J. G., Digital Signal Processing, Macmillan, New York,     N.Y. (1992); -   11. Vesma, J., and Saramäki, T., “Interpolation filters with     arbitrary frequency response for all-digital receivers,” in Proc.     1996 IEEE Int. Symp. Circuits Syst. (May 1996), pp. 568-571; -   12. Ahn, Y., et al., “VLSI design of a CORDIC-based derotator,” in     Proc. 1998 IEEE Int. Symp. Circuits Syst., Vol. II (May 1998), pp.     449-452; -   13. Wang, S., et al., IEEE Trans. Comp. 46:1202-1207 (1997); -   14. Madisetti, A., et al, IEEE J. Solid-State Circuits 34:1034-1043     (1999); -   15. Tan, L. and Samueli, H., IEEE J. Solid-State Circuits 30:193-200     (1995; -   16. Madisetti, A., “VLSI architectures and IC implementations for     bandwidth efficient communications,” Ph.D. dissertation, University     of California, Los Angeles (1996); -   17. Vankka, J., IEEE Trans. Ultrasonics, Ferroelectronics and Freq.     Control 44:526-534 (1997); -   18. Daneshrad, B., “System design of a 1.6 Mbps all-digital QAM     transceiver for digital subscriber line applications,” Ph.D.     dissertation, University of California, Los Angeles (1993); -   19. Tan, L., “High performance architectures and circuits for QAM     transceivers,” Ph.D. dissertation, University of California, Los     Angeles (1995); -   20. Gardner, S., Electron. Eng. 71:85-92 (1999); -   21. Gardner, S., Electron. Eng. 71:75-83 (1999); -   22. Sabel, L., and Cowley, W., “A recursive algorithm for the     estimation of symbol timing in PSK burst modems,” in Proc. Globecom     1992, vol. 1 (1992), pp. 360-364; -   23. Chen, A., et al., “Modified CORDIC demodulator implementation     for digital IF-sampled receiver,” in Proc. Globecom 1995, vol. 2     (1995), pp. 1450-1454; -   24. Boutin, N., IEEE Trans. Consumer Electron. 38:5-9 (1992); -   25. Meyr, H., et al., Digital Communication Receivers:     Synchronization, Channel Estimation and Signal Processing, Wiley,     New York, N.Y. (1998); -   26. Chen, A., and Yang, S., “Reduced complexity CORDIC demodulator     implementation for D-AMPS and digital IF-sampled receiver,” in Proc.     Globecom 1998, vol. 3 (1998), pp. 1491-1496; -   27. Andronico, M., et al., “A new algorithm for fast synchronization     in a burst mode PSK demodulator,” in Proc. 1995 IEEE Int. Conf:     Comm., vol. 3 (June 1995), pp. 1641-1646; -   28. Critchlow, D., “The design and simulation of a modulatable     direct digital synthesizer with non-iterative coordinate     transformation and noise shaping filter,” M.S. thesis, University of     California, San Diego (1989); -   29. Arivoli, T., et al., “A single chip DMT modem for high-speed     WLANs,” in Proc. 1998 Custom Integrated Circuits Conf. (May 1998),     pp. 9-11; -   30. Fitz, M. P., and Lindsey, W. C., IEEE Trans. Comm. 40:1644-1653     (1992); -   31. Fowler, D. L., and Smith, J. E., “An accurate high speed     implementation of division by reciprocal approximation,” in Proc.     9th Symp. on Computer Arithmetic (1989), pp. 60-67; -   32. Koren, I., Computer Arithmetic Algorithms, Prentice Hall,     Englewood Cliffs, N.J. (1993); -   33. Fu, D., and Willson, Jr., A. N., “Interpolation in timing     recovery using a trigonometric polynomial and its implementation,”     in Globecom 1998 Comm. Theory Mini Conf. Record (November 1998), pp.     173-178; -   34. Lang, T., and Antelo, E., IEEE Trans. Comp. 47:736-749 (1998); -   35. Moeneclaey, M., IEEE Trans. Comm. 31:1029-1032 (1983); -   36. Vuori, J., IEEE Trans. Consum. Electron. 45:1098-1103 (1999);     and -   37. Freeman, H., Discrete-Time Systems, Wiley, New York, N.Y.     (1965).

10. CONCLUSION

Example implementations of the methods, systems and components of the invention have been described herein. As noted elsewhere, these example implementations have been described for illustrative purposes only, and are not limiting. Other implementation embodiments are possible and covered by the invention, such as but not limited to software and software/hardware implementations of the systems and components of the invention. Such implementation embodiments will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein.

While various application embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments. 

1. In a digital circuit, processing digital data, a circuit for selectively calculating a result value ±C equal to the product of a multiplicand A and an N-bit multiplier B represented by a plurality of multiplier bits b₀ . . . b_(N−1) or the negative of such product, respectively, comprising: a selective negating circuit with a control input, where said selective negating circuit receives a plurality of said multiplier bits and outputs said plurality of multiplier bits in negated form in response to a first state of said control input and in non-inverted form in response to a second state of said control input; a plurality of decoding circuits connected to the negating circuit, each decoding circuit receiving said plurality of multiplier bits and producing a partial product output by multiplying the multiplicand by a value based on a Booth algorithm decoding of said multiplier bits; and summing means connected to said plurality of decoding circuits for summing said partial product outputs of said plurality of decoding circuits to produce a bit sequence representing the result value.
 2. The circuit of claim 1, where said control input comprises a negation control bit and said selective negating circuit comprises a circuit for calculating an exclusive-or of each of said multiplier bits with said negation control bit.
 3. In a digital circuit, processing digital data, a method of selectively calculating a result value ±C equal to the product of a multiplicand A and an N-bit multiplier B represented by a plurality of multiplier bits b₀ . . . b_(N−1) or the negative of such product, respectively, comprising the steps of: (a) receiving a plurality of said multiplier bits and a control input; (b) generating an output of said plurality of multiplier bits in inverted form in response to a first state of said control input and in non-inverted form in response to a second state of said control input; (c) receiving said plurality of multiplier bits in a plurality of decoding circuits and producing a partial product output by multiplying the multiplicand by a value based on a Booth algorithm decoding of said multiplier bits; and (d) summing said partial product outputs of said plurality of decoding circuits to produce a bit sequence representing the result value.
 4. The method of claim 3, wherein step (b) comprises the step of calculating an exclusive- or of each of said multiplier bits with at least one bit of said control input. 